Local branching
From MaRDI portal
Publication:1424277
DOI10.1007/s10107-003-0395-5zbMath1060.90056OpenAlexW4232585008MaRDI QIDQ1424277
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0395-5
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Column Generation based Primal Heuristics, Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility, Relax-fix-optimize heuristics for time-relaxed sports timetabling, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, Hybrid approaches for the two-scenario max-min knapsack problem, A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem, A mathematical programming-based heuristic for the production routing problem with transshipments, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, Branch-and-check approaches for the tourist trip design problem with rich constraints, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, Matheuristics: survey and synthesis, Maritime inventory routing: recent trends and future directions, Local branching relaxation heuristics for integer linear programs, Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups, A matheuristic for tri-objective binary integer linear programming, Split demand and deliveries in an integrated three-level lot sizing and replenishment problem, A learn‐and‐construct framework for general mixed‐integer programming problems, A matheuristic for the MinMax capacitated open vehicle routing problem, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, Integer Programming Formulations for the k-Cardinality Tree Problem, Solving Steiner trees: Recent advances, challenges, and perspectives, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, A New Scenario Reduction Method Based on Higher-Order Moments, Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems, Cross-dock facility for disaster relief operations, Robust maximum capture facility location under random utility maximization models, Progress in mathematical programming solvers from 2001 to 2020, A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, Hybridizations of evolutionary algorithms with large neighborhood search, Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem, A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem, Variable neighborhood search: the power of change and simplicity, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows, Feasibility jump: an LP-free Lagrangian MIP heuristic, Exact solution approaches for the discrete α‐neighbor p‐center problem, Exact solution of network flow models with strong relaxations, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, A branch-and-bound approach to the no-idle flowshop scheduling problem, Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, CP-Based Local Branching, Large neighborhood improvements for solving car sequencing problems, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Solution approaches to large shift scheduling problems, A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Heuristics of the Branch-Cut-and-Price-Framework SCIP, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, 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, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Unnamed Item, Semidefinite Programming and Constraint Programming, Unnamed Item, Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized, A Learning-Based Matheuristic for Stochastic Multicommodity Network Design, Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem, Matheuristics for the capacitated p‐median problem, Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective, A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking, A Fast Algorithm for Knapsack Problem with Conflict Graph, Scheduled Service Network Design for Freight Rail Transportation, Deep neural networks and mixed integer linear optimization, A bilevel planning model for public-private partnership, Heuristic solutions for the vehicle routing problem with time windows and synchronized visits, Integer programming techniques for the nurse rostering problem, Capacity consumption analysis using heuristic solution method for under construction railway routes, A heuristic for BILP problems: the single source capacitated facility location problem, A two-stage approach to the UCITS-constrained index-tracking problem, Branching strategies to improve regularity of crew schedules in ex-urban public transit, Decomposition based hybrid metaheuristics, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, Surgical scheduling with simultaneous employment of specialised human resources, Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles, Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, A model for clustering data from heterogeneous dissimilarities, A two-phase algorithm for the cyclic inventory routing problem, Searching for a cycle with maximum coverage in undirected graphs, An effective matheuristic for the capacitated total quantity discount problem, A hybrid heuristic approach for single machine scheduling with release times, Model-based automatic neighborhood design by unsupervised learning, The production routing problem: a review of formulations and solution algorithms, Fix-and-relax approaches for controlled tabular adjustment, The air-cargo consolidation problem with pivot weight: models and solution methods, A stochastic programming model for multi-product oriented multi-channel component replenishment, The green capacitated multi-item lot sizing problem with parallel machines, A decomposition heuristic for a rich production routing problem, A parallel local search framework for the fixed-charge multicommodity network flow problem, Matheuristics for the single-path design-balanced service network design problem, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks, 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, Robust gateway placement in wireless mesh networks, A hybrid three-phase approach for the Max-Mean dispersion problem, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, An exact algorithm for biobjective mixed integer linear programming problems, Integrating matheuristics and metaheuristics for timetabling, Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem, A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow, Global optima for the Zhou-Rozvany problem, Point-to-point shortest paths on dynamic time-dependent road networks, A recipe for finding good solutions to MINLPs, An efficient heuristic algorithm for the capacitated \(p\)-median problem, A set-covering based heuristic algorithm for the periodic vehicle routing problem, A hybrid algorithm for the DNA sequencing problem, Project scheduling with finite or infinite number of activity processing modes -- a survey, Heuristic and exact algorithms for a min-max selective vehicle routing problem, SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions, 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, A variable depth search branching, A variable neighborhood search based matheuristic for nurse rostering problems, Quality recovering of university timetables, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Boosting the feasibility pump, On the strength of Gomory mixed-integer cuts as group cuts, 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, Bounding, filtering and diversification in CP-based local branching, A heuristic approach for big bucket multi-level production planning problems, Proximity search for 0--1 mixed-integer convex programming, Water distribution networks design under uncertainty, Polylithic modeling and solution approaches using algebraic modeling systems, Recent trends in metaheuristics for stochastic combinatorial optimization, Mixed integer programming: A historical perspective with Xpress-MP, IP over 40+ years at IBM scientific centers and marketing, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Branching on general disjunctions, Variable neighbourhood search: methods and applications, Alternating control tree search for knapsack/covering problems, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, ZI round, a MIP rounding heuristic, A computational study of parametric tabu search for 0-1 mixed integer programs, Computational experience with a core-based reduction procedure for the 2-knapsack problem, A Lagrangian heuristic for satellite range scheduling with resource constraints, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, An ILP improvement procedure for the open vehicle routing problem, 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, Sequencing surgical cases in a day-care environment: an exact branch-and-price approach, A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules, Restrict-and-relax search for 0-1 mixed-integer programs, RENS. The optimal rounding, A matheuristic approach for the two-machine total completion time flow shop problem, Solving multiple scenarios in a combinatorial auction, On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs, Variable neighbourhood search: Methods and applications, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, A local branching heuristic for the capacitated fixed-charge network design problem, 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, Optimizing production and transportation in a commit-to-delivery business mode, Integer-programming software systems, Logical processing for integer programming, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem, A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design, Petroleum supply planning: reformulations and a novel decomposition algorithm, 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, Inversion of convection-diffusion equation with discrete sources, Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Variable neighborhood descent branching applied to the multi-way number partitioning problem, MIPping closures: An instant survey, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A supervised learning-driven heuristic for solving the facility location and production planning problem, A variable neighborhood search branching for the electric vehicle routing problem with time windows, Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching, New convergent heuristics for 0-1 mixed integer programming, Adaptive large neighborhood search for mixed integer programming, A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times, Design of a heuristic algorithm for the generalized multi-objective set covering problem, Pivot and shift -- a mixed integer programming heuristic, Generative deep learning for decision making in gas networks, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, A multiplicative weights update algorithm for MINLP, Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, Exact makespan minimization of unrelated parallel machines, Solving MIPs via scaling-based augmentation, Mathematical programming based heuristics for the 0--1 MIP: a survey, A learning large neighborhood search for the staff rerostering problem, Decision-based scenario clustering for decision-making under uncertainty, A symmetry-free polynomial formulation of the capacitated vehicle routing problem, The two-echelon inventory-routing problem with fleet management, Guided dive for the spatial branch-and-bound, Enhancing Benders decomposition algorithm to solve a combat logistics problem, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges, Adaptive kernel search: a heuristic for solving mixed integer linear programs, An ILP-based local search procedure for the VRP with pickups and deliveries, Thinning out Steiner trees: a node-based model for uniform edge costs, A variable neighborhood decomposition search method for supply chain management planning problems, Variable neighborhood search: basics and variants, On generating maximal nondominated Benders cuts, A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture, An effective hybrid approach to the two-stage capacitated facility location problem, Feasibility Pump-like heuristics for mixed integer problems, Integrated planning of ship deployment, service schedule and container routing, Optimizing locations and scales of emergency warehouses based on damage scenarios, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines, A local branching heuristic for solving a graph edit distance problem, Repairing MIP infeasibility through local branching, Computing feasible points for binary MINLPs with MPECs, The design of transparent optical networks minimizing the impact of critical nodes, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, Staff assignment with lexicographically ordered acceptance levels, Generalized local branching heuristics and the capacitated ring tree problem, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem, Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Warm-start heuristic for stochastic portfolio optimization with fixed and proportional transaction costs, A local branching heuristic for the open pit mine production scheduling problem, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, The search-and-remove algorithm for biobjective mixed-integer linear programming problems, A hybrid metaheuristic for the minimum labeling spanning tree problem, The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, 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, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, Rounding-based heuristics for nonconvex MINLPS, Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning, Variable neighborhood search and local branching, Exploring relaxation induced neighborhoods to improve MIP solutions, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, A dual heuristic for mixed integer programming, The two-echelon production-routing problem, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, The generalized reserve set covering problem with connectivity and buffer requirements, A comparative analysis of two matheuristics by means of merged local optima networks, A branch-and-cut algorithm for the edge interdiction clique problem, HMS: a hybrid multi-start algorithm for solving binary linear programs, A survey on matheuristics for routing problems, Hybrid heuristics for a short sea inventory routing problem, Structure-driven fix-and-propagate heuristics for mixed integer programming, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, An efficient train scheduling algorithm on a single-track railway system, Ten years of feasibility pump, and counting, FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming, The feasibility pump, 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, Combining very large scale and ILP based neighborhoods for a two-level location problem
