Pages that link to "Item:Q2489139"
From MaRDI portal
The following pages link to Variable neighborhood search and local branching (Q2489139):
Displayed 13 items.
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- General variable neighborhood search for the continuous optimization (Q932193) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← links)