A dual ascent procedure for the set partitioning problem
type: Item
instance of: scholarly article
title: A dual ascent procedure for the set partitioning problem
zbMATH Open document ID: 1179.90276
author: Aristide Mingozzi
author: Marco A. Boschetti
author: Salvatore Ricciardelli
published in: Discrete Optimization
publication date: 2008-11-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5369036
zbMATH Keywords: linear programming
zbMATH Keywords: large scale set partitioning
zbMATH Keywords: dual heuristics
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: subgradient optimization
describes a project that uses: OSL
describes a project that uses: CPLEX
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.06.001
OpenAlex ID: W1969951702
cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem
cites work: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
cites work: Set Partitioning: A survey
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: On some difficult linear programs coming from set partitioning
cites work: A least-squares primal-dual algorithm for solving linear programming problems
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: An exact algorithm for the simplified multiple depot crew scheduling problem
cites work: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
cites work: A Multiplier Adjustment Approach for the Set Partitioning Problem
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Constraint handling in genetic algorithms: the set partitioning problem
cites work: Graph theoretic relaxations of set covering and set partitioning problems
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
cites work: The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut
cites work: Computational results with a primal-dual subproblem simplex method
cites work: A concurrent processing framework for the set partitioning problem
cites work: A practical algorithm for computing a subadditive dual function for set partitioning
cites work: A parallel primal-dual simplex algorithm
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: A parallel, linear programming-based heuristic for large-scale set partitioning problems
cites work: A Set Partitioning Approach to the Crew Scheduling Problem
cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
cites work: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
DOI: 10.1016/J.DISOPT.2008.06.001
description: scientific article; zbMATH DE number 5369036