Exploring relaxation induced neighborhoods to improve MIP solutions

From MaRDI portal

Publication:1769074

Jump to:navigation, search

DOI10.1007/s10107-004-0518-7zbMath1131.90036OpenAlexW2004489140MaRDI QIDQ1769074

Edward Rothberg, Emilie Danna, Claude le Pape

Publication date: 17 March 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0518-7

zbMATH Keywords

Heuristics Mixed integer programming Local search Hybrid algorithms

Mathematics Subject Classification ID

Mixed integer programming (90C11) Search theory (90B40) 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, Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Three ideas for a feasibility pump for nonconvex MINLP, Advancing local search approximations for multiobjective combinatorial optimization problems, Optimization-based dispatching policies for open-pit mining, Inversion of convection-diffusion equation with discrete sources, Integer programming techniques for the nurse rostering problem, A heuristic for BILP problems: the single source capacitated facility location problem, A supervised learning-driven heuristic for solving the facility location and production planning problem, New convergent heuristics for 0-1 mixed integer programming, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, MIR closures of polyhedral sets, Adaptive large neighborhood search for mixed integer programming, Decomposition based hybrid metaheuristics, An effective matheuristic for the capacitated total quantity discount problem, Model-based automatic neighborhood design by unsupervised learning, Fix-and-relax approaches for controlled tabular adjustment, The air-cargo consolidation problem with pivot weight: models and solution methods, Matheuristics for the single-path design-balanced service network design problem, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, Integrating matheuristics and metaheuristics for timetabling, Inexact feasibility pump for mixed integer nonlinear programming, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints, Mathematical programming based heuristics for the 0--1 MIP: a survey, Guided dive for the spatial branch-and-bound, A recipe for finding good solutions to MINLPs, An efficient heuristic algorithm for the capacitated \(p\)-median problem, Bounds on the objective value of feasible roundings, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Adaptive kernel search: a heuristic for solving mixed integer linear programs, An ILP-based local search procedure for the VRP with pickups and deliveries, Heuristics for convex mixed integer nonlinear programs, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, Feasibility Pump-like heuristics for mixed integer problems, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Two local search approaches for solving real-life car sequencing problems, Soft car sequencing with colors: lower bounds and optimality proofs, Repairing MIP infeasibility through local branching, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Boosting the feasibility pump, Generalized local branching heuristics and the capacitated ring tree problem, Nonconvex, lower semicontinuous piecewise linear optimization, An algorithm for approximating the Pareto set of the multiobjective set covering problem, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Bounding, filtering and diversification in CP-based local branching, A heuristic approach for big bucket multi-level production planning problems, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, An efficient matheuristic for offline patient-to-bed assignment problems, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, Polylithic modeling and solution approaches using algebraic modeling systems, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, MIP formulations and heuristics for two-level production-transportation problems, Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem, Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem, Rounding-based heuristics for nonconvex MINLPS, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, A primal heuristic for optimizing the topology of gas networks based on dual information, Alternating control tree search for knapsack/covering problems, A computational study of parametric tabu search for 0-1 mixed integer programs, The traveling tournament problem with predefined venues, A Lagrangian heuristic for satellite range scheduling with resource constraints, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Preprocessing and cutting planes with conflict graphs, An ILP improvement procedure for the open vehicle routing problem, A dual heuristic for mixed integer programming, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, SCIP: solving constraint integer programs, Testing cut generators for mixed-integer linear programming, Structure-driven fix-and-propagate heuristics for mixed integer programming, Restrict-and-relax search for 0-1 mixed-integer programs, RENS. The optimal rounding, A trust branching path heuristic for zero-one programming, Granularity in nonlinear mixed-integer optimization, Solving multiple scenarios in a combinatorial auction, A constraints-aware reweighted feasibility pump approach, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Decomposition, reformulation, and diving in university course timetabling, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Feasibility pump 2.0, An efficient train scheduling algorithm on a single-track railway system, Optimizing production and transportation in a commit-to-delivery business mode, Fair ticket pricing in public transport as a constrained cost allocation game, A set covering approach for multi-depot train driver scheduling, Generalized relax-and-fix heuristic, Bi-objective facility location under uncertainty with an application in last-mile disaster relief, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, Integer-programming software systems, Column Generation based Primal Heuristics, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, Online perceptual learning and natural language acquisition for autonomous robots, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, Matheuristics: survey and synthesis, Local branching relaxation heuristics for integer linear programs, A matheuristic for tri-objective binary integer linear programming, A learn‐and‐construct framework for general mixed‐integer programming problems, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Progress in mathematical programming solvers from 2001 to 2020, Hybridizations of evolutionary algorithms with large neighborhood search, Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, Feasibility jump: an LP-free Lagrangian MIP heuristic, LS-LIB: A Library of Tools for Solving Production Planning Problems, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Solution approaches to large shift scheduling problems, Primal Heuristics for Branch and Price: The Assets of Diving Methods, A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs, Heuristics of the Branch-Cut-and-Price-Framework SCIP, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A framework for solving mixed-integer semidefinite programs, Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida, Conflict analysis in mixed integer programming, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, Unnamed Item, Presolve Reductions in Mixed Integer Programming, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, Unnamed Item, The feasibility pump

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1769074&oldid=14116786"