Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s13675-013-0012-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035888716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some matching problems arising in vehicle scheduling models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space network based exact optimization model for multi-depot bus scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Scheduling in Public Transit and Lagrangean Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of five heuristics for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem / rank
 
Normal rank

Latest revision as of 02:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
scientific article

    Statements

    Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2014
    0 references
    transportation scheduling
    0 references
    multicommodity flow
    0 references
    branch-and-cut algorithm
    0 references

    Identifiers