[ Reference Manual | Alphabetic Index ]

library(bfs)

Best-first search library   [more]

Predicates

BfsInstance:bfs_branch(+Branch)
Post a branching constraint to the bfs instance BfsInstance.
bfs_branch(?, ?)
No description available
bfs_branch(?, ?, ?)
No description available
bfs_deg_est(?, ?)
No description available
bfs_enhanced(?, ?)
No description available
bfs_fracvar(?)
No description available
bfs_get(?, ?, ?)
No description available
bfs_global_cut(?, ?)
No description available
bfs_impose_node_state(?, ?)
No description available
bfs_instance(++BfsInstance)
Initialises the bfs instance BfsInstance.
bfs_integers(?, ?)
No description available
bfs_minimize_eplex_node(?, ?)
No description available
bfs_node_cost(?, ?)
No description available
bfs_node_info(?, ?, ?)
No description available
bfs_node_info(?, ?, ?, ?, ?, ?)
No description available
bfs_set(?, ?, ?)
No description available
bfs_solve(?, ?)
No description available
bfs_solver_setup(?, ?, ?)
No description available
bfs_solver_setup(?, ?, ?, ?)
No description available
bfs_statistics(?)
No description available
bfs_strong(?, ?)
No description available
bfs_update_pseudocosts(?)
No description available
bfs_var_get(?, ?, ?, ?)
No description available
BfsInstance:get(++What, -Value)
Obtain information for the problem associated with BfsInstance.
BfsInstance:integers(+Ints)
Declare Ints as integers in BfsInstance.
BfsInstance:node_cost(+Val)
Set solution cost for the problem at a node.
BfsInstance:node_info(+Var, ?Lo, ?Hi, ?Val, ?RC)
Get or set node bounds and solution information for an individual solver problem variable Var.
BfsInstance:solve(-Cost)
Optimise the problem associated with BfsInstance.
BfsInstance:solver_setup(+OptSense, +Solver)
Setup a bfs solver tree for bfs instance BfsInstance.
BfsInstance:solver_setup(+OptSense, +Solver, ++ListOfOptions)
Setup a bfs solver tree for bfs instance BfsInstance.
BfsInstance:statistics
Display search tree statistics for bfs instance BfsInstance.
BfsInstance:var_get(+Var, ++What, -Value)
Obtain information for an individual solver problem variable Var.

Description

This library lets you use customisable branch-and-bound search. It is primarily intended for use with the colgen library in implementing branch-and-price algorithms, but can be used with arbitrary user-defined node solution, separation and selection goals. When application specific methods are not required for node separation and/or selection the use of built-in depth-first and best-first node selection, and branching on most fractional variable or generalised upper bound constraint may be specified. When the relaxed problem to be solved at a node involves an eplex instance branching may additionally be specified by built-in objective coefficient, estimate- or lower-bounding based methods, and best-estimate node selection may be used.

About


Generated from bfs.eci on 2017-09-29 01:22