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

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

Revision as of 01:30, 3 August 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

    Matheuristics: survey and synthesis (English)
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    integer programming
    0 references
    combinatorial optimisation
    0 references
    heuristics
    0 references
    matheuristics
    0 references
    Lagrangian relaxation
    0 references
    dual ascent
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers