On lower bounds for the fixed charge problem (Q337190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Veena G. Adlakha / rank
Normal rank
 
Property / author
 
Property / author: Veena G. Adlakha / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650734 / rank
 
Normal rank
Property / zbMATH Keywords
 
transportation problem
Property / zbMATH Keywords: transportation problem / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed charge
Property / zbMATH Keywords: fixed charge / rank
 
Normal rank
Property / zbMATH Keywords
 
quadratic approximation
Property / zbMATH Keywords: quadratic approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
branching method
Property / zbMATH Keywords: branching method / 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.2014.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043136567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the fixed-charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem. I: A new heuristic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate solution method for the fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: COLE: a new heuristic approach for fixed charge problem computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / 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: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / 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 vertex ranking algorithm for the fixed-charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic procedure for the fixed charge transportation 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 21:49, 12 July 2024

scientific article
Language Label Description Also known as
English
On lower bounds for the fixed charge problem
scientific article

    Statements

    On lower bounds for the fixed charge problem (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    transportation problem
    0 references
    fixed charge
    0 references
    quadratic approximation
    0 references
    branching method
    0 references

    Identifiers