A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
From MaRDI portal
Publication:2010923
Recommendations
- A dual ascent procedure for the set partitioning problem
- A set partitioning heuristic for the generalized assignment problem
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Heuristics, cutting planes and subgradient optimization for set partitioning problems
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
- A New Lower Bound for the Set-Partitioning Problem
- A practical algorithm for computing a subadditive dual function for set partitioning
Cites work
- scientific article; zbMATH DE number 1302177 (Why is no real title available?)
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Lagrangian-based heuristic for large-scale set covering problems
- A Primer in Column Generation
- A dual ascent procedure for the set partitioning problem
- A method for the cutting stock problem with different qualities
- A set covering based matheuristic for a real-world city logistics problem
- A set packing model for the ground holding problem in congested networks
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- An exact algorithm for the period routing problem
- An exact algorithm for the pickup and delivery problem with time windows
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An exact approach for the vertex coloring problem
- An exact solution framework for a broad class of vehicle routing problems
- An extension of set partitioning with application to scheduling problems
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Benchmarking optimization software with performance profiles.
- Column generation approaches to ship scheduling with flexible cargo sizes
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- Combining Column Generation and Lagrangian Relaxation
- Crew pairing at Air France
- ILP models and column generation for the minimum sum coloring problem
- Implementing Mixed Integer Column Generation
- Maximum-weight stable sets and safe lower bounds for graph coloring
- On some difficult linear programs coming from set partitioning
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Railway track allocation: Models and methods
- Set Partitioning: A survey
- Staff scheduling and rostering: a review of applications, methods and models.
- Survey, categorization, and comparison of recent tour scheduling literature
- The train driver recovery problem-a set partitioning based model and solution method
Cited in
(2)
This page was built for publication: A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010923)
