Benders decomposition, Lagrangean relaxation and metaheuristic design
From MaRDI portal
Publication:2271124
DOI10.1007/s10732-007-9064-9zbMath1176.90485OpenAlexW2027106651WikidataQ59195727 ScholiaQ59195727MaRDI QIDQ2271124
Vittorio Maniezzo, Marco Antonio Boschetti
Publication date: 6 August 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9064-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (20)
Boosting an exact logic-based Benders decomposition approach by variable neighborhood search ⋮ Decomposition based hybrid metaheuristics ⋮ A Lagrangian heuristic for sprint planning in agile software development ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Lagrangian heuristic for a class of the generalized assignment problems ⋮ Algorithms for nesting with defects ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem ⋮ The Benders decomposition algorithm: a literature review ⋮ A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Predictive analytics for real-time auction bidding support: a case on fantasy football ⋮ A set covering based matheuristic for a real‐world city logistics problem ⋮ Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types ⋮ A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Partitioning procedures for solving mixed-variables programming problems
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- The volume algorithm: Producing primal solutions with a subgradient method
- A repeated matching heuristic for the single-source capacitated facility location problem
- Future paths for integer programming and links to artificial intelligence
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- A constraint-based perspective in resource constrained project scheduling
- Minimization of unsmooth functionals
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Project scheduling with multiple modes: A genetic algorithm
- Simulated annealing for multi-mode resource-constrained project scheduling
This page was built for publication: Benders decomposition, Lagrangean relaxation and metaheuristic design
