Global and local search algorithms for concave cost transshipment problems (Q811873): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q535707
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Der-Shin Juang / 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.1007/s10898-004-3133-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028016928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for a concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems / 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: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using simulated annealing to solve routing and location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time solvable concave network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative algorithm for the fixed-charges transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted-entry method for a transportation problem with piecewise- linear concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to a problem in network design using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Genetic Algorithms for the Operations Researcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure / 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: Approximating reduced costs under degeneracy in a network flow problem with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic local search algorithms for concave cost transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank

Latest revision as of 10:30, 24 June 2024

scientific article
Language Label Description Also known as
English
Global and local search algorithms for concave cost transshipment problems
scientific article

    Statements

    Global and local search algorithms for concave cost transshipment problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2006
    0 references
    0 references
    Concave cost
    0 references
    Genetic algorithm
    0 references
    Global search
    0 references
    Local search
    0 references
    Transshipment problems
    0 references
    0 references
    0 references