A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.04.024 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076241887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-period incremental service facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multicut algorithm for two-stage stochastic linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem with stochastic travel and service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-period international facilities location: An algorithm and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Solving the Shortest Covering Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum covering/shortest path problem: A multiobjective network design and routing formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median tour and maximal covering tour problems: Formulations and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated dynamic location problems with opening, closure and reopening of facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem with variable profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage approach to the orienteering problem with stochastic weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-vehicle covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative three-component heuristic for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bayesian approach to a dynamic inventory model under an unknown demand distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational solution of capacity planning models under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic programming approach for supply chain network design under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for facility location and relocation problem with uncertain number of future facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic-demand capacitated facility location problems with and without relocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-objective stochastic covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Dynamic Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiperiod Location-Allocation Problem with Relocation of Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two stage linear programming under uncertainty with 0–1 integer first stage variables / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.04.024 / rank
 
Normal rank

Latest revision as of 13:44, 9 December 2024

scientific article
Language Label Description Also known as
English
A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
scientific article

    Statements

    A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    facilities planning and design
    0 references
    routing
    0 references
    fleet management
    0 references
    mobile facility
    0 references
    0 references
    0 references

    Identifiers