arxiv: 2604.02496 · v2 · submitted 2026-04-02 · 🧮 math.OC

Recognition: 2 theorem links

· Lean Theorem

On vehicle routing problems with stochastic demands -- Scenario-optimal recourse policies

Matheus J. Ota , Ricardo Fukasawa

Authors on Pith no claims yet

Pith reviewed 2026-05-13 20:57 UTC · model grok-4.3

classification 🧮 math.OC

keywords vehicle routingstochastic demandsrecourse policiesscenario recourse inequalitiesinteger L-shaped cutsmixed-integer programmingconvex hull

0 comments

The pith

Scenario recourse inequalities let vehicle routing problems with stochastic demands be solved exactly when recourse is chosen optimally per scenario.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces scenario recourse inequalities that describe the convex hull of feasible recourse actions for two-stage vehicle routing problems whose demands come from a finite set of scenarios. Instead of designing cuts for one specific recourse rule, the approach encodes any policy inside a higher-dimensional mixed-integer program and projects its valid inequalities onto the original route variables. The resulting inequalities remain valid under mild assumptions on the policy and become sufficient to formulate the problem exactly when the policy selects the best recourse action for each scenario separately. Experiments show that a branch-and-cut algorithm using these inequalities solves 329 more benchmark instances to optimality than the previous state-of-the-art integer L-shaped method.

Core claim

We cast recourse policies as solutions of a higher-dimensional mixed-integer program and characterize its convex hull in the original space via a new class of inequalities called scenario recourse inequalities. We show that SRIs are valid for any recourse policy satisfying mild assumptions and are sufficient for formulating the VRPSD under a scenario-optimal recourse policy. Under this latter policy, we also demonstrate that SRIs dominate several known classes of ILS cuts.

What carries the argument

Scenario recourse inequalities (SRIs), which project the convex hull of the higher-dimensional MIP encoding recourse actions for each scenario into the lower-dimensional space of first-stage routes.

If this is right

SRIs give a valid formulation for any VRPSD whose recourse policy meets the mild assumptions.
When the policy is scenario-optimal, the SRIs are sufficient to describe the problem exactly.
Under scenario-optimal recourse the SRIs dominate several known families of integer L-shaped cuts.
A branch-and-cut implementation using SRIs solves 329 more instances to optimality than the prior ILS algorithm on the test set.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The projection technique used to obtain SRIs could be applied to other two-stage stochastic combinatorial problems that admit a scenario-based description.
Real-time implementation of scenario-optimal recourse would require vehicles to replan dynamically once demands are observed, which is not modeled in the static first-stage routes.
Tighter relaxations might result from combining SRIs with other families of valid inequalities already known for vehicle routing.
The computational gain of 329 additional optima suggests that similar projection-based cuts could improve solvability on related problems such as stochastic inventory routing.

Load-bearing premise

The higher-dimensional mixed-integer program must correctly encode every feasible recourse action available in each scenario, and the policy must satisfy the mild assumptions required for the projected inequalities to be valid.

What would settle it

Solving the linear relaxation of a small VRPSD instance that includes the SRIs and obtaining a fractional solution whose corresponding second-stage actions are infeasible or suboptimal for at least one scenario.

Figures

Figures reproduced from arXiv: 2604.02496 by Matheus J. Ota, Ricardo Fukasawa.

**Figure 2.** Figure 2: Graphical representation of (¯x, y¯ ξ , ¯f ξ , g¯ ξ ). Here we have C = 10, wv3 = 6 and wv1 = wv2 = wv4 = 2. The black numbers next to each vertex indicate the scenario demand vector d ξ . The blue and solid arcs represent the vector ¯f ξ , while the red and dashed arcs represent the vector ¯g ξ . Let S1 = {v1, v2, v3} and S2 = {v3, v4} (green and violet regions in [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗

**Figure 3.** Figure 3: Empirical cumulative distribution of the execution times. The legend [PITH_FULL_IMAGE:figures/full_fig_p026_3.png] view at source ↗

**Figure 4.** Figure 4: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p045_4.png] view at source ↗

**Figure 5.** Figure 5: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p046_5.png] view at source ↗

**Figure 6.** Figure 6: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p046_6.png] view at source ↗

**Figure 7.** Figure 7: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p046_7.png] view at source ↗

**Figure 8.** Figure 8: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p047_8.png] view at source ↗

**Figure 9.** Figure 9: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p047_9.png] view at source ↗

**Figure 10.** Figure 10: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p047_10.png] view at source ↗

**Figure 11.** Figure 11: Empirical cumulative distribution of the execution times and root gaps for [PITH_FULL_IMAGE:figures/full_fig_p048_11.png] view at source ↗

read the original abstract

Two-Stage Vehicle Routing Problems with Stochastic Demands (VRPSDs) form a class of stochastic combinatorial optimization problems where routes are planned in advance, demands are revealed upon vehicle arrival, and recourse actions are triggered whenever capacity is exceeded. Following recent works, we consider VRPSDs where demands are given by an empirical probability distribution of scenarios. Existing approaches rely on integer L-shaped (ILS) cuts, whose coefficients are tailored for specific recourse policies. In contrast, we propose a framework that casts recourse policies as solutions of a higher-dimensional mixed-integer program, and we characterize its convex hull in the original lower-dimensional space via a new class of inequalities called scenario recourse inequalities (SRIs). We show that SRIs are valid for any recourse policy satisfying mild assumptions and are sufficient for formulating the VRPSD under a scenario-optimal recourse policy, where the recourse actions are chosen optimally for each scenario. Under this latter policy, we also demonstrate that SRIs dominate several known classes of ILS cuts. We conduct computational experiments on the VRPSD with scenarios under both the classical and the scenario-optimal recourse policies. By using the SRIs, our algorithm solves 329 more instances to optimality than the previous state-of-the-art ILS algorithm.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

SRIs are a clean new cut family derived from an explicit lifted MIP for scenario-optimal recourse, and the reported solve-rate jump is worth checking against a matched baseline.

read the letter

The core advance is deriving scenario recourse inequalities directly from the convex hull of a higher-dimensional MIP that encodes recourse actions per scenario. This gives valid cuts for any recourse policy meeting the mild assumptions, and they dominate several standard ILS cuts when the policy is scenario-optimal. The authors then plug the SRIs into a branch-and-cut solver and report solving 329 more instances to optimality than the prior ILS state of the art on the usual test sets. That is a concrete practical result for a class of problems that matters in logistics. The derivation looks technically sound on the abstract and the dominance claim is specific rather than generic. The experiments cover both the classical and scenario-optimal policies, which is useful. The main soft spot is the computational comparison. The headline delta only isolates the effect of SRIs if the ILS baseline was re-implemented inside the same framework with identical solver settings, branching, and cut management. If the numbers come from the original literature runs, differences in code or tuning could explain part of the gap. The validity and dominance proofs are asserted but would need a line-by-line check for any hidden assumptions in the projection step. Overall this is a solid technical paper for researchers working on stochastic routing and cutting-plane methods for two-stage combinatorial problems. It gives implementable stronger cuts and measurable gains on standard instances. A serious editor should send it to referees; the contribution is focused enough and the experiments are large enough to justify the time.

Referee Report

3 major / 2 minor

Summary. The manuscript introduces scenario recourse inequalities (SRIs) derived from the projection of a higher-dimensional mixed-integer program modeling recourse actions in two-stage vehicle routing problems with stochastic demands (VRPSDs) under scenario-based demand distributions. It establishes validity of SRIs for recourse policies meeting mild assumptions, sufficiency for the scenario-optimal recourse policy, dominance over integer L-shaped (ILS) cuts in that setting, and reports solving 329 additional instances to optimality compared to prior ILS methods in experiments.

Significance. The development of SRIs offers a more general and potentially tighter formulation for VRPSDs, which could advance solution techniques for stochastic vehicle routing. The reported computational improvements, if attributable to the new inequalities, indicate enhanced practical solvability for instances with scenario demands.

major comments (3)

[Abstract and computational experiments section] Abstract and computational experiments section: The headline claim that SRIs enable solving 329 more instances to optimality than the prior ILS state-of-the-art is load-bearing for the practical contribution. The manuscript must explicitly confirm that the ILS baseline was re-implemented inside the authors' branch-and-cut framework with identical MIP solver, branching rules, cut pool management, and time limits; otherwise the delta cannot be attributed to the new inequalities rather than implementation differences.
[Section on theoretical results (likely §3)] Section on theoretical results (likely §3): The sufficiency claim for scenario-optimal recourse requires an explicit argument that the higher-dimensional MIP correctly encodes optimal recourse actions per scenario and that its projection yields the convex hull in the original space. A counter-example or missing case under the mild assumptions would undermine the formulation.
[Dominance section (likely §4)] Dominance section (likely §4): The statement that SRIs dominate known ILS cuts under scenario-optimal recourse needs a concrete theorem or numerical example showing a specific ILS cut that is strictly weaker than the corresponding SRI; without this the dominance result remains at the level of an assertion.

minor comments (2)

[Notation] Notation for scenario indices and recourse variables should be unified across the MIP formulation and the projected inequalities to avoid reader confusion.
[MIP formulation] The description of the higher-dimensional MIP in the main text would benefit from a small illustrative example with 2-3 scenarios to make the projection step concrete.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major point below, indicating planned revisions where appropriate to strengthen the manuscript.

read point-by-point responses

Referee: [Abstract and computational experiments section] The headline claim that SRIs enable solving 329 more instances to optimality than the prior ILS state-of-the-art is load-bearing for the practical contribution. The manuscript must explicitly confirm that the ILS baseline was re-implemented inside the authors' branch-and-cut framework with identical MIP solver, branching rules, cut pool management, and time limits; otherwise the delta cannot be attributed to the new inequalities rather than implementation differences.

Authors: We confirm that the ILS baseline was re-implemented inside our branch-and-cut framework using the identical MIP solver, branching rules, cut pool management, and time limits. This ensures the performance delta is due to the SRIs. We will add an explicit statement to this effect in the computational experiments section. revision: yes
Referee: [Section on theoretical results (likely §3)] The sufficiency claim for scenario-optimal recourse requires an explicit argument that the higher-dimensional MIP correctly encodes optimal recourse actions per scenario and that its projection yields the convex hull in the original space. A counter-example or missing case under the mild assumptions would undermine the formulation.

Authors: The manuscript derives the SRIs via projection of the higher-dimensional MIP and proves validity under the mild assumptions, with sufficiency shown for the scenario-optimal policy. We agree the argument can be stated more explicitly. We will revise Section 3 to include a dedicated paragraph detailing the encoding of optimal per-scenario recourse actions in the MIP and confirming that the projection yields the convex hull, with a brief check that no counter-examples arise under the stated assumptions. revision: yes
Referee: [Dominance section (likely §4)] The statement that SRIs dominate known ILS cuts under scenario-optimal recourse needs a concrete theorem or numerical example showing a specific ILS cut that is strictly weaker than the corresponding SRI; without this the dominance result remains at the level of an assertion.

Authors: The manuscript establishes dominance by showing that SRIs are valid and subsume the ILS cuts under the scenario-optimal policy. To make this concrete, we will add both a short theorem formalizing the dominance relation and a numerical example in the revised Section 4 that exhibits a specific ILS cut strictly weaker than the corresponding SRI. revision: yes

Circularity Check

0 steps flagged

SRIs derived from explicit higher-dimensional MIP without reduction to inputs

full rationale

The paper's central derivation casts recourse policies as feasible solutions to a higher-dimensional MIP and obtains SRIs by characterizing the convex hull of that MIP projected back to the original space. This is a standard polyhedral construction that does not rely on self-definition, fitted parameters renamed as predictions, or load-bearing self-citations. The abstract and described framework treat the MIP encoding as an independent modeling step whose validity follows from the recourse assumptions; the resulting inequalities are shown to be valid and sufficient by direct argument rather than by circular reference to prior results of the same authors. Computational comparisons are presented as empirical evidence, not as part of the derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard mixed-integer programming theory for convex-hull descriptions and on the assumption that recourse actions can be encoded as an MIP; no free parameters or invented entities are introduced.

axioms (1)

domain assumption Mild assumptions on recourse policies suffice for validity of SRIs
Explicitly stated as the condition under which SRIs remain valid for any such policy.

pith-pipeline@v0.9.0 · 5515 in / 1063 out tokens · 37625 ms · 2026-05-13T20:57:24.595080+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We characterize the convex hull of recourse policies (Theorem 2) ... y ξ(R′) ≥ k ξ(R′)−1 ... consecutive ones property, so ... totally unimodular
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1 (Hoffman’s circulation theorem) ... h(δ⁻(S)) ≥ d′(S)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

45 extracted references · 45 canonical work pages · 1 internal anchor

[1]

Robust discrete optimization and network flows

Dimitris Bertsimas and Melvyn Sim. Robust discrete optimization and network flows. Mathematical programming, 98 0 (1): 0 49--71, 2003

work page 2003
[2]

The price of robustness

Dimitris Bertsimas and Melvyn Sim. The price of robustness. Operations research, 52 0 (1): 0 35--53, 2004

work page 2004
[3]

Introduction to stochastic programming

John R Birge and Francois Louveaux. Introduction to stochastic programming. Springer Science & Business Media, 2011

work page 2011
[4]

Recovering D antzig-- W olfe bounds by cutting planes

Rui Chen, Oktay G \"u nl \"u k, and Andrea Lodi. Recovering D antzig-- W olfe bounds by cutting planes. Operations Research, 2024

work page 2024
[5]

Christiansen and Jens Lysgaard

Christian H. Christiansen and Jens Lysgaard. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters, 35 0 (6): 0 773--781, 2007. ISSN 0167-6377

work page 2007
[6]

Conforti, Gerard Cornuej\' o ls, and Giacomo

Michele. Conforti, Gerard Cornuej\' o ls, and Giacomo. Zambelli. Integer Programming. Graduate Texts in Mathematics, 271. Springer International Publishing, Cham, 2014. ISBN 9783319110080

work page 2014
[7]

Cook, W.H

W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization. Wiley, 2011. ISBN 9781118031391

work page 2011
[8]

Dantzig, R

G.B. Dantzig, R. Fulkerson, and S.M. Johnson. Solution of a large-scale traveling salesman problem. Operations Research, 2: 0 393--410, 1954

work page 1954
[9]

Lemon--an open source c++ graph template library

Bal \'a zs Dezs o , Alp \'a r J \"u ttner, and P \'e ter Kov \'a cs. Lemon--an open source c++ graph template library. Electronic Notes in Theoretical Computer Science, 264 0 (5): 0 23--45, 2011

work page 2011
[10]

On the complexity of the separation problem for rounded capacity inequalities

Ibrahima Diarrassouba. On the complexity of the separation problem for rounded capacity inequalities. Discrete Optimization, 25: 0 86--104, 2017. ISSN 1572-5286

work page 2017
[11]

Exact algorithms for the chance-constrained vehicle routing problem

Thai Dinh, Ricardo Fukasawa, and James Luedtke. Exact algorithms for the chance-constrained vehicle routing problem. Mathematical Programming, 172 0 (1): 0 105--138, Nov 2018. ISSN 1436-4646

work page 2018
[12]

Vehicle routing with stochastic demands: Properties and solution frameworks

Moshe Dror, Gilbert Laporte, and Pierre Trudeau. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science, 23 0 (3): 0 166--176, 1989

work page 1989
[13]

Florio, Richard F

Alexandre M. Florio, Richard F. Hartl, and Stefan Minner. New exact algorithm for the vehicle routing problem with stochastic demands. Transportation Science, 54 0 (4): 0 1073--1090, 2020

work page 2020
[14]

Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut

Alexandre M Florio, Michel Gendreau, Richard F Hartl, Stefan Minner, and Thibaut Vidal. Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut. European Journal of Operational Research, 2022

work page 2022
[15]

About lagrangian methods in integer optimization

Antonio Frangioni. About lagrangian methods in integer optimization. Annals of Operations Research, 139: 0 163--193, 2005

work page 2005
[16]

Experiments with a generic D antzig- W olfe decomposition for integer programs

Gerald Gamrath and Marco E L \"u bbecke. Experiments with a generic D antzig- W olfe decomposition for integer programs. In International Symposium on Experimental Algorithms, pages 239--252. Springer, 2010

work page 2010
[17]

A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands

Charles Gauvin, Guy Desaulniers, and Michel Gendreau. A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Computers & Operations Research, 50: 0 141--153, 2014. ISSN 0305-0548

work page 2014
[18]

An exact algorithm for the vehicle routing problem with stochastic demands and customers

Michel Gendreau, Gilbert Laporte, and René Séguin. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science, 29 0 (2): 0 143--155, 1995

work page 1995
[19]

50th anniversary invited article—future research directions in stochastic vehicle routing

Michel Gendreau, Ola Jabali, and Walter Rei. 50th anniversary invited article—future research directions in stochastic vehicle routing. Transportation Science, 50 0 (4): 0 1163--1173, 2016

work page 2016
[20]

The one-commodity pickup-and-delivery travelling salesman problem

Hip \'o lito Hern \'a ndez-P \'e rez and Juan-Jos \'e Salazar-Gonz \'a lez. The one-commodity pickup-and-delivery travelling salesman problem. In Combinatorial Optimization—Eureka, You Shrink! Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5--9, 2001 Revised Papers, pages 89--104. Springer, 2003

work page 2001
[21]

New optimality cuts for a single-vehicle stochastic routing problem

Curt Hjorring and John Holt. New optimality cuts for a single-vehicle stochastic routing problem. Annals of Operations Research, 86 0 (0): 0 569--584, 1999

work page 1999
[22]

Some recent applications of the theory of linear inequalities to extremal combinatorial analysis

Alan J Hoffman. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. New York, NY, pages 113--117, 1958

work page 1958
[23]

An improved integer L -shaped method for the vehicle routing problem with stochastic demands

YN Hoogendoorn and R Spliet. An improved integer L -shaped method for the vehicle routing problem with stochastic demands. INFORMS Journal on Computing, 35 0 (2): 0 423--439, 2023

work page 2023
[24]

An evaluation of common modeling choices for the vehicle routing problem with stochastic demands

YN Hoogendoorn and R Spliet. An evaluation of common modeling choices for the vehicle routing problem with stochastic demands. European Journal of Operational Research, 321 0 (1): 0 107--122, 2025

work page 2025
[25]

Partial-route inequalities for the multi-vehicle routing problem with stochastic demands

Ola Jabali, Walter Rei, Michel Gendreau, and Gilbert Laporte. Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discrete Applied Mathematics, 177: 0 121--136, 2014. ISSN 0166-218X

work page 2014
[26]

A branch and bound algorithm for the capacitated vehicle routing problem

Gilbert Laporte and Yves Nobert. A branch and bound algorithm for the capacitated vehicle routing problem. Operations-Research-Spektrum, 5 0 (2): 0 77--85, 1983

work page 1983
[27]

Louveaux, and Luc van Hamme

Gilbert Laporte, François V. Louveaux, and Luc van Hamme. An integer L -shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research, 50 0 (3): 0 415--423, 2002

work page 2002
[28]

Superadditivity properties and new valid inequalities for the vehicle routing problem with stochastic demands

Robin Legault, Panca Jodiawan, Jean-Fran c ois C \^o t \'e , and Leandro C Coelho. Superadditivity properties and new valid inequalities for the vehicle routing problem with stochastic demands. arXiv preprint arXiv:2508.05877, 2025

work page arXiv 2025
[29]

Exact approach for the vehicle routing problem with stochastic demands and preventive returns

Fran c ois V Louveaux and Juan-Jos \'e Salazar-Gonz \'a lez. Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Transportation Science, 52 0 (6): 0 1463--1478, 2018

work page 2018
[30]

Letchford, and Richard W

Jens Lysgaard, Adam N. Letchford, and Richard W. Eglese. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100 0 (2): 0 423--445, 2004. ISSN 1436-4646

work page 2004
[31]

Nemhauser and L.A

G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988

work page 1988
[32]

Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios

Matheus J Ota and Ricardo Fukasawa. Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios. Operations Research, 2024

work page 2024
[33]

Ota, Ricardo Fukasawa, and Aleksandr M

Matheus J. Ota, Ricardo Fukasawa, and Aleksandr M. Kazachkov. Approximating value functions via corner B enders' cuts. Online preprint: https://arxiv.org/abs/2509.21758 , 2025

work page arXiv 2025
[34]

On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations

Matheus Jun Ota and Ricardo Fukasawa. On vehicle routing problems with stochastic demands -- G eneric integer L -shaped formulations. Online preprint: https://arxiv.org/abs/2510.04043 , 2025

work page internal anchor Pith review Pith/arXiv arXiv 2025
[35]

Woodruff

Jorge Oyola, Halvard Arntzen, and David L. Woodruff. The stochastic vehicle routing problem, a literature review, P art I : models. EURO Journal on Transportation and Logistics, 7 0 (3): 0 193--221, 2018. ISSN 2192-4376

work page 2018
[36]

A disaggregated integer L -shaped method for stochastic vehicle routing problems with monotonic recourse

Lucas Parada, Robin Legault, Jean-Fran c ois C \^o t \'e , and Michel Gendreau. A disaggregated integer L -shaped method for stochastic vehicle routing problems with monotonic recourse. European Journal of Operational Research, 2024

work page 2024
[37]

Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem

Konstantin Pavlikov, Niels Christian Petersen, and Jon Lilholt S rensen. Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem. Networks, 83 0 (1): 0 197--209, 2024

work page 2024
[38]

The benders decomposition algorithm: A literature review

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, and Walter Rei. The benders decomposition algorithm: A literature review. European Journal of Operational Research, 259 0 (3): 0 801--817, 2017

work page 2017
[39]

A hybrid recourse policy for the vehicle routing problem with stochastic demands

Majid Salavati-Khoshghalb, Michel Gendreau, Ola Jabali, and Walter Rei. A hybrid recourse policy for the vehicle routing problem with stochastic demands. EURO Journal on Transportation and Logistics, 8 0 (3): 0 269--298, Sep 2019 a . ISSN 2192-4384

work page 2019
[40]

An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy

Majid Salavati-Khoshghalb, Michel Gendreau, Ola Jabali, and Walter Rei. An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy. European Journal of Operational Research, 273 0 (1): 0 175--189, 2019 b . ISSN 0377-2217

work page 2019
[41]

A rule-based recourse for the vehicle routing problem with stochastic demands

Majid Salavati-Khoshghalb, Michel Gendreau, Ola Jabali, and Walter Rei. A rule-based recourse for the vehicle routing problem with stochastic demands. Transportation Science, 53 0 (5): 0 1334--1353, 2019 c

work page 2019
[42]

The multiple terminal delivery problem with probabilistic demands

Frank A Tillman. The multiple terminal delivery problem with probabilistic demands. Transportation Science, 3 0 (3): 0 192--204, 1969

work page 1969
[43]

The Vehicle Routing Problem

Paolo Toth and Daniele Vigo, editors. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, 2002

work page 2002
[44]

Stochastic vehicle routing problem with restocking

Wen-Huei Yang, Kamlesh Mathur, and Ronald H Ballou. Stochastic vehicle routing problem with restocking. Transportation science, 34 0 (1): 0 99--112, 2000

work page 2000
[45]

Yee and Bruce L

James R. Yee and Bruce L. Golden. A note on determining operating strategies for probabilistic vehicle routing. Naval Research Logistics Quarterly, 27 0 (1): 0 159--163, 1980

work page 1980