Pages that link to "Item:Q1073718"
From MaRDI portal
The following pages link to Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718):
Displaying 12 items.
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- A simple strategy for solving a class of 0-1 integer programming models (Q1090232) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- An analysis of six greedy selection rules on a class of zero-one integer programming models (Q3478264) (← links)
- A heuristic with tie breaking for certain 0–1 integer programming models (Q3731368) (← links)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
