Pages that link to "Item:Q4018152"
From MaRDI portal
The following pages link to Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System (Q4018152):
Displaying 12 items.
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- An algorithm for the mixed-integer nonlinear bilevel programming problem (Q1184528) (← links)
- A multiple criteria model for the allocation of data files in a distributed information system (Q1185987) (← links)
- Weighted graphs and university course timetabling (Q1185992) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- MINTO, a Mixed INTeger Optimizer (Q1331882) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- Supporting rural telecommunications: A compromise solutions approach (Q2365099) (← links)
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks (Q2368099) (← links)
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program (Q3220353) (← links)
- Multicriteria hub decision making for rural area telecommunication networks (Q5943929) (← links)
