Routing Optimization Under Uncertainty (Q2806069)

From MaRDI portal

Revision as of 15:20, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ior/JailletQS16, #quickstatements; #temporary_batch_1731505720702)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Routing Optimization Under Uncertainty	scientific article

Statements

scholarly article

0 references

Routing Optimization Under Uncertainty (English)

0 references

Patrick Jaillet

0 references

0 references

0 references

Operations Research

0 references

publication date

13 May 2016

0 references

full work available at URL

http://hdl.handle.net/1721.1/111105

0 references

zbMATH Keywords

vehicle routing

0 references

uncertain travel time

0 references

robust optimization

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

The robust vehicle routing problem with time windows

0 references

Complexity of the min-max and min-max regret assignment problems

0 references

An Economic Index of Riskiness

0 references

Interval data minmax regret network optimization problems

0 references

A Vehicle Routing Problem with Stochastic Demand

0 references

Robust discrete optimization and network flows

0 references

The Price of Robustness

0 references

A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty

0 references

Satisficing Measures for Analysis of Risky Positions

0 references

Reduction approaches for robust shortest path problems

0 references

A stochastic dynamic traveling salesman problem with hard time windows

0 references

0 references

A New Formulation for the Travelling Salesman Problem

0 references

The traveling salesman problem on a graph and some related integer polyhedra

0 references

Maxmin expected utility with non-unique prior

0 references

The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty

0 references

Managing Underperformance Risk in Project Portfolio Selection

0 references

Dynamic journeying under uncertainty

0 references

A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited

0 references

0 references

The problem of calculating the volume of a polyhedron is enumerably hard

0 references

Stochastic Shortest Path Problem with Delay Excess Penalty

0 references

Robust discrete optimization and its applications

0 references

Multiple Objectives Satisficing Under Uncertainty

0 references

A concise guide to the Traveling Salesman Problem

0 references

A branch and bound algorithm for the robust shortest path problem with interval data.

0 references

Stochastic Shortest Paths Via Quasi-convex Maximization

0 references

A comparative analysis of several asymmetric traveling salesman problem formulations

0 references

Vehicle routing with soft time windows and Erlang travel times

0 references

A robust optimization approach to dispatching technicians under stochastic service times

0 references

Vehicle routing problem with stochastic travel times including soft time windows and service costs

0 references

Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach

0 references

Models, relaxations and exact approaches for the capacitated vehicle routing problem

0 references

Distributionally Robust Convex Optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1287/opre.2015.1462

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/ior/JailletQS16

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2806069

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2806069&oldid=37906691"