Matheuristics: survey and synthesis (Q6056873): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:02, 30 December 2024

scientific article; zbMATH DE number 7745315

Language	Label	Description	Also known as
English	Matheuristics: survey and synthesis	scientific article; zbMATH DE number 7745315

Statements

scholarly article

0 references

Matheuristics: survey and synthesis (English)

0 references

Marco Antonio Boschetti

0 references

Adam N. Letchford

0 references

Vittorio Maniezzo

0 references

International Transactions in Operational Research

0 references

publication date

4 October 2023

0 references

zbMATH Keywords

integer programming

0 references

combinatorial optimisation

0 references

heuristics

0 references

matheuristics

0 references

Lagrangian relaxation

0 references

dual ascent

0 references

MaRDI profile type

MaRDI publication profile

0 references

Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic

0 references

Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems

0 references

A set‐partitioning‐based exact algorithm for the vehicle routing problem

0 references

A survey of very large-scale neighborhood search techniques

0 references

Kernel search: a general heuristic for the multi-dimensional knapsack problem

0 references

Kernel search: a new heuristic framework for portfolio selection

0 references

0 references

An effective heuristic for large-scale capacitated facility location problems

0 references

Combinatorial Benders Cuts for the Minimum Tollbooth Problem

0 references

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design

0 references

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

0 references

Octane: A New Heuristic for Pure 0–1 Programs

0 references

A restricted Lagrangean approach to the traveling salesman problem

0 references

Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

0 references

Pivot and Complement–A Heuristic for 0-1 Programming

0 references

A heuristic lagrangean algorithm for the capacitated plant location problem

0 references

Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation

0 references

Dual-ascent methods for large-scale multicommodity flow problems

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Algorithms for the non-bifurcated network design problem

0 references

A dynamic programming based heuristic for the assembly line balancing problem

0 references

An algorithm for set covering problem

0 references

0 references

Lagrangean heuristics for location problems

0 references

0 references

Solving the \(p\)-median problem with a semi-Lagrangian relaxation

0 references

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

0 references

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

0 references

Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming

0 references

0 references

Heuristics for Multilevel Lot-Sizing with a Bottleneck

0 references

0 references

Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization

0 references

A set covering based matheuristic for a real‐world city logistics problem

0 references

An exact algorithm for the simplified multiple depot crew scheduling problem

0 references

A dual ascent procedure for the set partitioning problem

0 references

Two very large-scale neighborhoods for single machine scheduling

0 references

Matching based very large-scale neighborhoods for parallel machine scheduling

0 references

New approaches to nurse rostering benchmark instances

0 references

A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem

0 references

A matheuristic algorithm for the pollution and energy minimization traveling salesman problems

0 references

Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem

0 references

A Heuristic Method for the Set Covering Problem

0 references

Fast primal and dual heuristics for the \(p\)-median location problem

0 references

A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup>

0 references

A Lagrangian-based heuristic for large-scale set covering problems

0 references

Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems

0 references

Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems

0 references

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

0 references

Integer Programming

0 references

Combinatorial Benders' Cuts for the Strip Packing Problem

0 references

Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing

0 references

Exploring relaxation induced neighborhoods to improve MIP solutions

0 references

Decomposition Principle for Linear Programs

0 references

A new ILP-based refinement heuristic for vehicle routing problems

0 references

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem

0 references

On the complexity of surrogate and group relaxation for integer linear programs

0 references

Revisiting surrogate relaxation for the multidimensional knapsack problem

0 references

A Dual-Based Procedure for Uncapacitated Facility Location

0 references

Interior Path Methods for Heuristic Integer Programming Procedures

0 references

The feasibility pump

0 references

Local branching

0 references

An Additive Bounding Procedure for Combinatorial Optimization Problems

0 references

An additive bounding procedure for the asymmetric travelling salesman problem

0 references

A dual algorithm for the one-machine scheduling problem

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

A Multiplier Adjustment Method for the Generalized Assignment Problem

0 references

Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

0 references

Surrogate duality relaxation for job shop scheduling

0 references

A heuristic routine for solving large loading problems

0 references

A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems

0 references

Heuristics and reduction methods for multiple constraints 0-1 linear programming problems

0 references

A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem

0 references

A method for solving to optimality uncapacitated location problems

0 references

0 references

Surrogate Constraint Duality in Mathematical Programming

0 references

0 references

Dynamic programming based heuristics for the topological design of local access networks

0 references

Surrogate Mathematical Programming

0 references

Adaptive kernel search: a heuristic for solving mixed integer linear programs

0 references

A Lagrangean dual ascent algorithm for simple plant location problems

0 references

Lagrangean relaxation. (With comments and rejoinder).

0 references

An application-oriented guide for designing Lagrangean dual ascent algorithms

0 references

Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem

0 references

Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation

0 references

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

0 references

Efficient Heuristic Procedures for Integer Linear Programming with an Interior

0 references

Approximation Algorithms for the Set Covering and Vertex Cover Problems

0 references

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

0 references

A dynamic programming heuristic for the \(P\)-median problem

0 references

An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem

0 references

An improved Lagrangian relaxation and dual ascent approach to facility location problems

0 references

A new Lagrangian relaxation approach to the generalized assignment problem

0 references

Surrogate Dual Multiplier Search Procedures in Integer Programming

0 references

Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation

0 references

A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints

0 references

Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach

0 references

A dual algorithm for the uncapacitated hub location problem

0 references

On the exact solution of large-scale simple plant location problems

0 references

Combinatorial optimization. Theory and algorithms

0 references

0 references

Fast bounding procedures for large instances of the simple plant location problem

0 references

Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions

0 references

A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks

0 references

Lagrangian heuristic for a class of the generalized assignment problems

0 references

Solving zero-one mixed integer programming problems using tabu search

0 references

A surrogate heuristic for set covering problems

0 references

Relaxation heuristics for a generalized assignment problem

0 references

Multilevel capacitated lotsizing complexity and LP-based heuristics

0 references

A heuristic algorithm for the multidimensional zero-one knapsack problem

0 references

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

0 references

Matheuristics. Algorithms and implementations

0 references

Heuristic algorithms for the portfolio selection problem with minimum transaction lots

0 references

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

0 references

Handbook of Heuristics

0 references

A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing

0 references

LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup

0 references

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

0 references

Very large-scale variable neighborhood search for the generalized assignment problem

0 references

Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem

0 references

An application of a Lagrangian-type relaxation for the uncapacitated facility location problem

0 references

0 references

An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem

0 references

A dual RAMP algorithm for single source capacitated facility location problems

0 references

Efficient algorithms for the capacitated concentrator location problem

0 references

A heuristic solution procedure for the multiconstraint zero-one knapsack problem

0 references

Improved algorithms for the Steiner problem in networks

0 references

An exact cooperative method for the uncapacitated facility location problem

0 references

Handbook of metaheuristics

0 references

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

0 references

Decomposition based hybrid metaheuristics

0 references

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

0 references

0 references

RAMP for the capacitated minimum spanning tree problem

0 references

Primal Heuristics for Branch and Price: The Assets of Diving Methods

0 references

The G4-Heuristic for the Pallet Loading Problem

0 references

0 references

Preface to the Special Issue on Matheuristics and Metaheuristics

0 references

A heuristic algorithm based on Lagrangian relaxation for the closest string problem

0 references

Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

0 references

Solving a distribution problem with side constraints

0 references

Linear programming. Foundations and extensions

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

A heuristic algorithm for the asymmetric capacitated vehicle routing problem

0 references

An algorithm for large scale 0-1 integer programming with application to airline crew scheduling

0 references

The Design of Approximation Algorithms

0 references

0 references

A dual ascent approach for steiner tree problems on a directed graph

0 references

Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics

0 references

Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

10.1111/ITOR.13301

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6056873

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6056873&oldid=39674079"