An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
From MaRDI portal
Publication:2892364
DOI10.1287/ijoc.1060.0189zbMath1241.90092OpenAlexW2136931788MaRDI QIDQ2892364
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1060.0189
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design, Deep neural networks and mixed integer linear optimization, Learning optimal decision trees using constraint programming, Single-commodity robust network design problem: complexity, instances and heuristic solutions, Integer constraints for enhancing interpretability in linear regression, Adaptive large neighborhood search for mixed integer programming, Finding robust timetables for project presentations of student teams, Offsetting inventory replenishment cycles, A parallel local search framework for the fixed-charge multicommodity network flow problem, 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, Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, 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, Adaptive kernel search: a heuristic for solving mixed integer linear programs, Hybridizations of evolutionary algorithms with large neighborhood search, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A framework for solving mixed-integer semidefinite programs, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Bounding, filtering and diversification in CP-based local branching, A dynamic reformulation heuristic for generalized interdiction problems, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, Exact approaches for integrated aircraft fleeting and routing at TunisAir, A primal heuristic for optimizing the topology of gas networks based on dual information, Primal Heuristics for Branch-and-Price Algorithms, The traveling tournament problem with predefined venues, Structure-driven fix-and-propagate heuristics for mixed integer programming, RENS. The optimal rounding, MIP‐and‐refine matheuristic for smart grid energy management, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
