Matheuristics: survey and synthesis
From MaRDI portal
(Redirected from Matheuristics: survey and synthesis)
Cites work
- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A dual algorithm for the one-machine scheduling problem
- A dual algorithm for the uncapacitated hub location problem
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent procedure for the set partitioning problem
- A dual RAMP algorithm for single source capacitated facility location problems
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Dual-Based Procedure for Uncapacitated Facility Location
- A dynamic programming based heuristic for the assembly line balancing problem
- A dynamic programming heuristic for the \(P\)-median problem
- A dynamic programming heuristic for the quadratic knapsack problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A Heuristic Method for the Set Covering Problem
- A heuristic routine for solving large loading problems
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A Lagrangean dual ascent algorithm for simple plant location problems
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A Lagrangian-based heuristic for large-scale set covering problems
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
- A method for solving to optimality uncapacitated location problems
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A new ILP-based refinement heuristic for vehicle routing problems
- A new Lagrangian relaxation approach to the generalized assignment problem
- A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A restricted Lagrangean approach to the traveling salesman problem
- A set covering based matheuristic for a real-world city logistics problem
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- A surrogate heuristic for set covering problems
- A survey of very large-scale neighborhood search techniques
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
- Algorithms for the non-bifurcated network design problem
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An additive bounding procedure for the asymmetric travelling salesman problem
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- An algorithm for set covering problem
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- An approximate dynamic programming approach to multidimensional knapsack problems
- An effective heuristic for large-scale capacitated facility location problems
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- An exact algorithm for the simplified multiple depot crew scheduling problem
- An exact cooperative method for the uncapacitated facility location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Branch-and-price: Column generation for solving huge integer programs
- Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions
- Combinatorial Benders cuts for the minimum tollbooth problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Combinatorial optimization. Theory and algorithms
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Decomposition based hybrid metaheuristics
- Decomposition Principle for Linear Programs
- Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation
- Dual-ascent methods for large-scale multicommodity flow problems
- Dynamic programming based heuristics for the topological design of local access networks
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- Efficient algorithms for the capacitated concentrator location problem
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fast bounding procedures for large instances of the simple plant location problem
- Fast primal and dual heuristics for the \(p\)-median location problem
- Fundamentals of scatter search and path relinking
- Handbook of heuristics
- Handbook of metaheuristics
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 5152600 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 221925 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 2209665 (Why is no real title available?)
- Improved algorithms for the Steiner problem in networks
- Integer Programming
- Interior Path Methods for Heuristic Integer Programming Procedures
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- Lagrangean heuristics for location problems
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangian heuristic for a class of the generalized assignment problems
- Linear programming. Foundations and extensions
- Local branching
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Matheuristics. Algorithms and implementations
- MIP: Theory and practice -- closing the gap
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- New approaches to nurse rostering benchmark instances
- Octane: A New Heuristic for Pure 0–1 Programs
- On the complexity of surrogate and group relaxation for integer linear programs
- On the exact solution of large-scale simple plant location problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Partitioning procedures for solving mixed-variables programming problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Preface to the Special Issue on Matheuristics and Metaheuristics
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Primal-dual variable neighborhood search for the simple plant-location problem
- RAMP for the capacitated minimum spanning tree problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Relaxation heuristics for a generalized assignment problem
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
- Solving a distribution problem with side constraints
- Solving the p-median problem with a semi-Lagrangian relaxation
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Solving zero-one mixed integer programming problems using tabu search
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate duality relaxation for job shop scheduling
- Surrogate Mathematical Programming
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The design of approximation algorithms
- The feasibility pump
- The G4-Heuristic for the Pallet Loading Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Two very large-scale neighborhoods for single machine scheduling
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Very large-scale variable neighborhood search for the generalized assignment problem
Cited in
(7)- Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
- Last fifty years of integer linear programming: a focus on recent practical advances
- A matheuristic with re-lot-sizing strategies for flexible job-shop rescheduling problem with lot-streaming and machine reconfigurations
- Contemporary approaches in matheuristics an updated survey
- A fast local search for the identical parallel machine scheduling problem with the position-based deteriorating effect and maintenance
- Optimisation of bus timetables: an adaptive large neighbourhood search-based matheuristic with a novel operator weight
- Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching
This page was built for publication: Matheuristics: survey and synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056873)
