Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RELAX4 / rank
 
Normal rank
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.1016/j.cor.2010.11.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090539371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial combinatorial algorithm for generalized minimum cost flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Out-of-Kilter Method for Minimal-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost flows by double scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot Strategies for Primal-Simplex Network Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Convex Cost Dynamic Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulation and relaxation to solve a concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Minimization in Networks with Discrete Stochastic Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using mathematical programming heuristics in a multicriteria network flow context / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of fuzzy minimum cost flow problems to network design under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy multi-level minimum cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some branch-and-bound procedures for fixed-cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Method for the Fixed Charge Transportation Problem / 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: Solving to optimality the uncapacitated fixed-charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search applied to the general fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:28, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimal-cost network flow problems with variable lower bounds on arc flows
scientific article

    Statements

    Minimal-cost network flow problems with variable lower bounds on arc flows (English)
    0 references
    0 references
    25 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    network optimization
    0 references
    variable lower bound
    0 references
    minimal cost network flow
    0 references
    generalized network
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references