Sciweavers

14548 search results - page 75 / 2910
» The Optimal Path-Matching Problem
Sort
View
FAW
2010
Springer
203views Algorithms» more  FAW 2010»
13 years 8 months ago
Online Algorithms for the Newsvendor Problem with and without Censored Demands
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
Peter Sempolinski, Amitabh Chaudhary
MP
2010
145views more  MP 2010»
13 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
CDC
2010
IEEE
13 years 5 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard
SIAMCO
2010
124views more  SIAMCO 2010»
13 years 4 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...
EVOW
2012
Springer
12 years 5 months ago
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...
Martin Schwengerer, Sandro Pirkwieser, Günthe...