An evolutionary algorithm for polishing mixed integer programming solutions
From MaRDI portal
Recommendations
Cited in
(47)- An evolutionary programming approach to mixed-variable optimization problems
- Evolution and state-of-the-art in integer programming
- Deep neural networks and mixed integer linear optimization
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A dynamic reformulation heuristic for generalized interdiction problems
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Adaptive large neighborhood search for mixed integer programming
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
- A primal heuristic for optimizing the topology of gas networks based on dual information
- The traveling tournament problem with predefined venues
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Evolutionary algorithms for production planning problems with setup decisions
- Finding robust timetables for project presentations of student teams
- Offsetting inventory replenishment cycles
- An Evolutionary Solver for Pure Integer Linear Programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A framework for solving mixed-integer semidefinite programs
- Integer constraints for enhancing interpretability in linear regression
- Primal Heuristics for Branch-and-Price Algorithms
- Bounding, filtering and diversification in CP-based local branching
- MIP-and-refine matheuristic for smart grid energy management
- Proximity search for 0--1 mixed-integer convex programming
- Shift-and-propagate
- Hybrid evolutionary algorithm for mixed-integer programming problems
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Genetic Programming
- Local branching relaxation heuristics for integer linear programs
- A learn‐and‐construct framework for general mixed‐integer programming problems
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- Multi‐objective optimization of the maritime cargo routing and scheduling problem
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Hybridizations of evolutionary algorithms with large neighborhood search
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- A location-allocation model for food distribution in post-disaster environments
- Solution polishing via path relinking for continuous black-box optimization
- Last fifty years of integer linear programming: a focus on recent practical advances
- A fix-propagate-repair heuristic for mixed integer programming
- RENS. The optimal rounding
- Learning optimal decision trees using constraint programming
This page was built for publication: An evolutionary algorithm for polishing mixed integer programming solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892364)
