Matheuristics: survey and synthesis

Related Items

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Cites Work

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
Decomposition based hybrid metaheuristics
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
Matching based very large-scale neighborhoods for parallel machine scheduling
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
Kernel search: a new heuristic framework for portfolio selection
An exact cooperative method for the uncapacitated facility location problem
Lagrangian heuristic for a class of the generalized assignment problems
A survey of very large-scale neighborhood search techniques
A heuristic algorithm for the multidimensional zero-one knapsack problem
A heuristic lagrangean algorithm for the capacitated plant location problem
Multilevel capacitated lotsizing complexity and LP-based heuristics
Solving the \(p\)-median problem with a semi-Lagrangian relaxation
A Lagrangean dual ascent algorithm for simple plant location problems
A method for solving to optimality uncapacitated location problems
A dual ascent procedure for the set partitioning problem
A dynamic programming based heuristic for the assembly line balancing problem
Kernel search: a general heuristic for the multi-dimensional knapsack problem
Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
An effective heuristic for large-scale capacitated facility location problems
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
Efficient algorithms for the capacitated concentrator location problem
A new Lagrangian relaxation approach to the generalized assignment problem
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
On the exact solution of large-scale simple plant location problems
Partitioning procedures for solving mixed-variables programming problems
Solving a distribution problem with side constraints
Surrogate duality relaxation for job shop scheduling
Fast primal and dual heuristics for the \(p\)-median location problem
Dynamic programming based heuristics for the topological design of local access networks
An additive bounding procedure for the asymmetric travelling salesman problem
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
A heuristic algorithm for the asymmetric capacitated vehicle routing problem
Relaxation heuristics for a generalized assignment problem
A dynamic programming heuristic for the \(P\)-median problem
A Lagrangian-based heuristic for large-scale set covering problems
Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions
Heuristic algorithms for the portfolio selection problem with minimum transaction lots
A surrogate heuristic for set covering problems
Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
Local branching
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
Solving zero-one mixed integer programming problems using tabu search
Adaptive kernel search: a heuristic for solving mixed integer linear programs
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
A heuristic algorithm based on Lagrangian relaxation for the closest string problem
Fast bounding procedures for large instances of the simple plant location problem
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
Exploring relaxation induced neighborhoods to improve MIP solutions
An improved Lagrangian relaxation and dual ascent approach to facility location problems
Lagrangean heuristics for location problems
An algorithm for set covering problem
Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
An application-oriented guide for designing Lagrangean dual ascent algorithms
Lagrangean relaxation. (With comments and rejoinder).
An exact algorithm for the simplified multiple depot crew scheduling problem
An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
On the complexity of surrogate and group relaxation for integer linear programs
Revisiting surrogate relaxation for the multidimensional knapsack problem
A dual RAMP algorithm for single source capacitated facility location problems
A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
Matheuristics. Algorithms and implementations
An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
Algorithms for the non-bifurcated network design problem
An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
RAMP for the capacitated minimum spanning tree problem
New approaches to nurse rostering benchmark instances
The feasibility pump
A new ILP-based refinement heuristic for vehicle routing problems
Two very large-scale neighborhoods for single machine scheduling
Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
Branch-and-Price: Column Generation for Solving Huge Integer Programs
An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
Combinatorial Benders' Cuts for the Strip Packing Problem
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
The Design of Approximation Algorithms
A Multiplier Adjustment Method for the Generalized Assignment Problem
Combinatorial Benders Cuts for the Minimum Tollbooth Problem
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Integer Programming
Decomposition Principle for Linear Programs
A dual ascent approach for steiner tree problems on a directed graph
Surrogate Dual Multiplier Search Procedures in Integer Programming
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Handbook of Heuristics
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Very large-scale variable neighborhood search for the generalized assignment problem
Octane: A New Heuristic for Pure 0–1 Programs
Heuristics for Multilevel Lot-Sizing with a Bottleneck
A heuristic solution procedure for the multiconstraint zero-one knapsack problem
An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem
Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
An Additive Bounding Procedure for Combinatorial Optimization Problems
A Dual-Based Procedure for Uncapacitated Facility Location
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
Pivot and Complement–A Heuristic for 0-1 Programming
Interior Path Methods for Heuristic Integer Programming Procedures
A restricted Lagrangean approach to the traveling salesman problem
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Approximation Algorithms for the Set Covering and Vertex Cover Problems
A heuristic routine for solving large loading problems
Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation
A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
Surrogate Constraint Duality in Mathematical Programming
A dual algorithm for the one-machine scheduling problem
A dual algorithm for the uncapacitated hub location problem
Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Dual-ascent methods for large-scale multicommodity flow problems
The G4-Heuristic for the Pallet Loading Problem
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
A set‐partitioning‐based exact algorithm for the vehicle routing problem
Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
A Heuristic Method for the Set Covering Problem
Primal Heuristics for Branch and Price: The Assets of Diving Methods
A set covering based matheuristic for a real‐world city logistics problem
Efficient Heuristic Procedures for Integer Linear Programming with an Interior
Surrogate Mathematical Programming
Combinatorial optimization. Theory and algorithms
Handbook of metaheuristics
Linear programming. Foundations and extensions
Improved algorithms for the Steiner problem in networks
Preface to the Special Issue on Matheuristics and Metaheuristics
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item