A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/0377-2217(94)90126-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083957197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using shortest paths in some transshipment problems with concave costs / 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: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave cost minimization on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the min concave cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation approach to the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Linear Programming Solves the Dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Global Concave Minimization: A Bibliographic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Facility Location with Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost routing for static network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On building minimum cost communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convex Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:18, 23 May 2024

scientific article
Language Label Description Also known as
English
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
scientific article

    Statements

    A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (English)
    0 references
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    0 references
    heuristic
    0 references
    capacitated concave minimum cost network flow
    0 references
    Lagrangean dualization
    0 references
    subgradient search
    0 references
    lower bound
    0 references
    0 references