Benders decomposition, Lagrangean relaxation and metaheuristic design
From MaRDI portal
Publication:2271124
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- scientific article; zbMATH DE number 1305496 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1931807 (Why is no real title available?)
- scientific article; zbMATH DE number 1857493 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A constraint-based perspective in resource constrained project scheduling
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- A repeated matching heuristic for the single-source capacitated facility location problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- 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
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Efficient algorithms for the capacitated concentrator location problem
- Future paths for integer programming and links to artificial intelligence
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- Minimization of unsmooth functionals
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Project scheduling with multiple modes: A genetic algorithm
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Simulated annealing for multi-mode resource-constrained project scheduling
- The volume algorithm: Producing primal solutions with a subgradient method
Cited in
(21)- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Benders decomposition for a period-aggregated resource leveling problem with variable job duration
- A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- A hybrid differential evolution algorithm with column generation for resource constrained job scheduling
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach
- The Benders decomposition algorithm: a literature review
- Modeling and solving vehicle routing problems with many available vehicle types
- Multiple allocation tree of hubs location problem for non-complete networks
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- A meta-heuristic extension of the Lagrangian heuristic framework
- Lagrangian heuristic for a class of the generalized assignment problems
- Predictive analytics for real-time auction bidding support: a case on fantasy football
- Algorithms for nesting with defects
- A Lagrangian-ACO matheuristic for car sequencing
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
- A set covering based matheuristic for a real-world city logistics problem
- 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
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)
