Pages that link to "Item:Q2892364"

The following pages link to An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions (Q2892364):

Displaying 35 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)
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• Learning optimal decision trees using constraint programming (Q823772) (← links)
• Deep neural networks and mixed integer linear optimization (Q1617390) (← links)
• A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
• Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company (Q2177829) (← 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)
• Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← 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)
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• Integer constraints for enhancing interpretability in linear regression (Q4969267) (← links)
• Primal Heuristics for Branch-and-Price Algorithms (Q5176283) (← links)
• MIP‐and‐refine matheuristic for smart grid energy management (Q5246820) (← links)
• A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
• A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
• Multi‐objective optimization of the maritime cargo routing and scheduling problem (Q6082269) (← links)
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)