An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
DOI10.1016/0377-2217(89)90389-5zbMATH Open0679.90043OpenAlexW1971890464MaRDI QIDQ1823142FDOQ1823142
Authors: Celso C. Ribeiro, Manoel Camillo Penna, Michel Minoux 
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90389-5
Recommendations
lower boundsapproximate solutionsmatrix decompositiontraffic assignmentcolumn generation techniquebranch- and-boundlarge-scale set partitioning
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Finding the K Shortest Loopless Paths in a Network
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- On the complexity of decomposing matrices arising in satellite communication
- Traffic assignment in communication satellites
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
Cited In (34)
- A one-to-one correspondence between colorings and stable sets
- Column generation applied to linear programs in course registration
- Graph theoretic relaxations of set covering and set partitioning problems
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- New bounds for optimum traffic assignment in satellite communication.
- A survey of algorithms for the generalized assignment problem
- A column generation approach to job grouping for flexible manufacturing systems
- A network relaxation based enumeration algorithm for set partitioning
- Title not available (Why is that?)
- Searching for optimal integer solutions to set partitioning problems using column generation
- A set partitioning approach to shunting
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- Column-Generation in Integer Linear Programming
- Exact weighted vertex coloring via branch-and-price
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- Complementary column generation and bounding approaches for set partitioning formulations
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- Penalty computations for the set partitioning problem
- Algorithms for large scale set covering problems
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Models and heuristic algorithms for a weighted vertex coloring problem
- Column generation for the equilibrium route-flow traffic assignment problem
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Modeling and solving a crew assignment problem in air transportation
- Enhancing an algorithm for set covering problems
- Design of cellular manufacturing systems
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019
- Solving binary cutting stock problems by column generation and branch- and-bound
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- Knowledge based approach to the cutting stock problem
- A survey on vertex coloring problems
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
This page was built for publication: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823142)
