object
milp_branch_and_bound
Portable depth-first branch-and-bound solver for small mixed-integer linear programs.
Availability:
logtalk_load(linear_programming(loader))Author: Paulo Moura
Version: 1:0:0
Date: 2026-09-03
Compilation flags:
static, context_switching_callsRemarks:
Discrete domains: Integer and binary variables must have finite bounds. No cutting planes or primal heuristics are used.
LP relaxations: Each search node is solved using the simplex object.
Branching: The solver can branch on the first fractional variable or the most fractional variable, with declaration order breaking ties. The lower or upper branch can be explored first.
Inherited public predicates:
check_option/1 check_options/1 constraint/5 constraints/3 default_option/1 default_options/1 new_problem/1 objective/4 objective_value/2 option/2 option/3 print_problem/1 print_solution/1 problem_from_matrices/8 solve/2 solve/3 statistics/2 status/2 valid_option/1 valid_options/1 variable/4 variable/6 variable_value/3
Public predicates
(no local declarations; see entity ancestors if any)
Protected predicates
(no local declarations; see entity ancestors if any)
Private predicates
(no local declarations; see entity ancestors if any)
Operators
(none)
See also