Pages that link to "Item:Q2401328"
From MaRDI portal
The following pages link to Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328):
Displaying 11 items.
- A heuristic 0-1 integer programming method (Q1190388) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem (Q2861506) (← links)
- Octane: A New Heuristic for Pure 0–1 Programs (Q3634996) (← links)
- A heuristic with tie breaking for certain 0–1 integer programming models (Q3731368) (← links)
- (Q3804458) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- One-shot learning for MIPs with SOS1 constraints (Q6579097) (← links)