Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Lot-sizing with fixed charges on stocks: the convex hull'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot sizing with backlogging: the convex hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementary class of generalized flow cover inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for uncapacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-charge transportation on a path: optimization, LP formulations and separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing with fixed charges on stocks: the convex hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity and valid inequalities in capacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank

Revision as of 09:27, 14 July 2024

scientific article; zbMATH DE number 6770401
Language Label Description Also known as
English
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
scientific article; zbMATH DE number 6770401

    Statements

    Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2017
    0 references
    valid inequalities
    0 references
    submodular functions
    0 references
    covers and packs
    0 references
    fixed-charge networks
    0 references
    mixed-integer programming
    0 references
    0 references

    Identifiers