A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds (Q2027659): 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.1007/s40314-020-01349-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101042699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The late acceptance hill-climbing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization approach to capacitated single and multiple allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for location-arc routing problems with vehicle capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Territorial design optimization for business sales plan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization: current successes and directions for the future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization for relief logistics planning under uncertainties in demand and transportation time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-arc routing problem: heuristic approaches and test instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent research on location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location arc routing problem with inventory constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the standard location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:52, 25 July 2024

scientific article
Language Label Description Also known as
English
A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
scientific article

    Statements

    A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds (English)
    0 references
    0 references
    0 references
    28 May 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    location-arc routing
    0 references
    mathematical model
    0 references
    lower and upper bounds
    0 references
    robust optimization
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references