The column-circular, subsets-selection problem: Complexity and solutions
From MaRDI portal
Recommendations
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A dynamic programming approach to the complete set partitioning problem
- An O(m n) algorithm for regular set-covering problems
- Absolute bounds on optimal cost for a class of set covering problems
- The set covering problem: Complexity, algorithms, experiments
Cites work
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- An extension of set partitioning with application to scheduling problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Cyclic Scheduling via Integer Programs with Circular Ones
- Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles
- Extensions of the Petal Method for Vehicle Routeing
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- The Operator-Scheduling Problem: A Network-Flow Approach
Cited in
(6)- A dynamic programming approach to the complete set partitioning problem
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
- On the attack problem for a family of subsets
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
This page was built for publication: The column-circular, subsets-selection problem: Complexity and solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974273)
