A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
type: Item
instance of: scholarly article
title: A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
zbMATH Open document ID: 1506.90108
author: Stefania Pan
author: Mahuna Akplogan
author: L. Létocart
author: Nora Touati
author: Roberto Wolfler Calvo
published in: Discrete Optimization
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7138067
zbMATH Keywords: dual ascent heuristic
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: subgradient method
zbMATH Keywords: generalized set partitioning
MaRDI profile type: Publication
full work available at URL: j.disopt.2019.05.001
OpenAlex ID: W2947392384
cites work: Set Partitioning: A survey
cites work: Q4247444
cites work: An extension of set partitioning with application to scheduling problems
cites work: ILP models and column generation for the minimum sum coloring problem
cites work: Staff scheduling and rostering: a review of applications, methods and models.
cites work: Survey, categorization, and comparison of recent tour scheduling literature
cites work: Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce
cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
cites work: An exact approach for the vertex coloring problem
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: Crew pairing at Air France
cites work: The train driver recovery problem-a set partitioning based model and solution method
cites work: Column generation approaches to ship scheduling with flexible cargo sizes
cites work: A method for the cutting stock problem with different qualities
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: A set packing model for the ground holding problem in congested networks
cites work: Railway track allocation: Models and methods
cites work: A set covering based matheuristic for a real‐world city logistics problem
cites work: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
cites work: A set-covering based heuristic algorithm for the periodic vehicle routing problem
cites work: A Primer in Column Generation
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: On some difficult linear programs coming from set partitioning
cites work: A dual ascent procedure for the set partitioning problem
cites work: An exact solution framework for a broad class of vehicle routing problems
cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
cites work: An Exact Algorithm for the Period Routing Problem
cites work: Combining Column Generation and Lagrangian Relaxation
cites work: Maximum-weight stable sets and safe lower bounds for graph coloring
cites work: Implementing Mixed Integer Column Generation
cites work: Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1016/J.DISOPT.2019.05.001
Recommended article: A dual ascent procedure for the set partitioning problem
Recommended article: A set partitioning heuristic for the generalized assignment problem
Recommended article: Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
Recommended article: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Recommended article: Q5323365
Recommended article: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Recommended article: Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
Recommended article: Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
Recommended article: A New Lower Bound for the Set-Partitioning Problem
Recommended article: A practical algorithm for computing a subadditive dual function for set partitioning
description: scientific article; zbMATH DE number 7138067