The following pages link to (Q4340910):
Displaying 12 items.
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- General purpose heuristics for integer programming. I (Q1365114) (← links)
- Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Advances in linear and nonlinear programming (Q2923565) (← links)
- Preprocessing composite cutting procedure: an approach to the integer model (Q3604028) (← links)
- Recent advances in the decomposition approach to linear programming (Q3777795) (← links)
- Commentary—Progress in Linear Programming (Q4291493) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Advances in Combinatorial Optimization (Q5744058) (← links)