Benders decomposition, Lagrangean relaxation and metaheuristic design

DOI10.1007/S10732-007-9064-9zbMATH Open1176.90485OpenAlexW2027106651WikidataQ59195727 ScholiaQ59195727MaRDI QIDQ2271124FDOQ2271124

Authors: Vittorio Maniezzo, Marco A. 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

Recommendations

• Decomposition based hybrid metaheuristics
• Combinatorial decomposition and industrial applications.
• Accelerating Benders decomposition with heuristic master problem solutions
• Lagrangean relaxation. (With comments and rejoinder).
• On using approximations of the Benders master problem

zbMATH Keywords

combinatorial optimizationmetaheuristicLagrangean relaxationBenders's decomposition

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Partitioning procedures for solving mixed-variables programming problems
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
• Title not available (Why is that?)
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• An exact algorithm for the capacitated facility location problems with single sourcing
• 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
• Title not available (Why is that?)
• The volume algorithm: Producing primal solutions with a subgradient method
• Efficient algorithms for the capacitated concentrator location problem
• A repeated matching heuristic for the single-source capacitated facility location problem
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Title not available (Why is that?)
• Minimization of unsmooth functionals
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Project scheduling with multiple modes: A genetic algorithm
• Simulated annealing for multi-mode resource-constrained project scheduling
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• A heuristic lagrangean algorithm for the capacitated plant location problem
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Title not available (Why is that?)
• A constraint-based perspective in resource constrained project scheduling
• Lagrangean heuristics applied to a variety of large capacitated plant location problems

Cited In (20)

• Multiple allocation tree of hubs location problem for non-complete networks
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• A set covering based matheuristic for a real‐world city logistics problem
• A hybrid differential evolution algorithm with column generation for resource constrained job scheduling
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• The Benders decomposition algorithm: a literature review
• Decomposition based hybrid metaheuristics
• A decomposition based solution algorithm for U-type assembly line balancing with interval data
• Lagrangian heuristic for a class of the generalized assignment problems
• Algorithms for nesting with defects
• A Lagrangian-ACO matheuristic for car sequencing
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• A Lagrangian heuristic for sprint planning in agile software development
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
• Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
• Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types
• Predictive analytics for real-time auction bidding support: a case on fantasy football
• A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
• A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem

Uses Software

• Tabu search
• PeerSim

This page was built for publication: Benders decomposition, Lagrangean relaxation and metaheuristic design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271124)