Pages that link to "Item:Q1085067"
From MaRDI portal
The following pages link to The reduced cost branch and bound algorithm for mixed integer programming (Q1085067):
Displaying 7 items.
- Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
- A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
- Algorithms for solving the mixed integer two-level linear programming problem (Q1825131) (← links)
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program (Q3220353) (← links)
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System (Q4018152) (← links)