Pages that link to "Item:Q1785392"
From MaRDI portal
The following pages link to A dual heuristic for mixed integer programming (Q1785392):
Displaying 10 items.
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- A first look at picking dual variables for maximizing reduced cost fixing (Q2011594) (← links)
- Pivot and shift -- a mixed integer programming heuristic (Q2386208) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- On the existence of duality gaps for mixed integer programming (Q5460687) (← links)
- Chapter 9: An MPEC based heuristic (Q5740755) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)