The column-circular, subsets-selection problem: Complexity and solutions

DOI10.1016/S0305-0548(99)00058-1zbMath0973.90017MaRDI QIDQ1974273

Jacques Renaud, Fayez F. Boctor

Publication date: 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

complexityschedulingroutingset-partitioningset-coveringset-packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Traffic problems in operations research (90B20)

Related Items (4)

A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands ⋮ 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 ⋮ A sweep-based algorithm for the fleet size and mix vehicle routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of set partitioning with application to scheduling problems
• Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Cyclic Scheduling via Integer Programs with Circular Ones
• An Integer Programming Approach to the Vehicle Scheduling Problem
• The Operator-Scheduling Problem: A Network-Flow Approach
• Extensions of the Petal Method for Vehicle Routeing

This page was built for publication: The column-circular, subsets-selection problem: Complexity and solutions