Pages that link to "Item:Q2892364"
From MaRDI portal
The following pages link to An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions (Q2892364):
Displayed 16 items.
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Finding robust timetables for project presentations of student teams (Q320999) (← links)
- Offsetting inventory replenishment cycles (Q323293) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Shift-and-propagate (Q524884) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- Primal Heuristics for Branch-and-Price Algorithms (Q5176283) (← links)
- MIP‐and‐refine matheuristic for smart grid energy management (Q5246820) (← links)