Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a real-world train-unit assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge sequences, antimatroids, and the transportation problem with forbidden arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a flow problem with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundant coupling/decoupling in train unit scheduling optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convex hulls for a special class of integer multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the fixed charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classical transportation problems revisited: pure constant fixed charges and the paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs / rank
 
Normal rank

Latest revision as of 14:53, 19 August 2024

scientific article; zbMATH DE number 7769717
Language Label Description Also known as
English
Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
scientific article; zbMATH DE number 7769717

    Statements

    Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2023
    0 references
    0 references
    fixed-charge multi-commodity flow
    0 references
    flows on bipartite graphs
    0 references
    heuristic branching
    0 references
    train unit scheduling
    0 references
    unnecessary flow demerging/remerging
    0 references
    0 references