Pages that link to "Item:Q804472"
From MaRDI portal
The following pages link to An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472):
Displaying 15 items.
- Resolution search (Q674925) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- A global approach for general \(0-1\) fractional programming (Q1328656) (← links)
- A new bounding technique in branch-and-bound algorithms for mixed integer programming (Q1384440) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- Solving a problem of the choice of products by means of the branch and bound method (Q2885245) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. (A primal algorithm of generalized linear programming for mixed integer programs) (Q3986703) (← links)
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System (Q4018152) (← links)
- (Q4939281) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
