Pages that link to "Item:Q5642449"
From MaRDI portal
The following pages link to Experiments in mixed-integer linear programming (Q5642449):
Displayed 7 items.
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs (Q5675545) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)