14518 search results - page 303 / 2904 » Two Problems for Sophistication |
163
click to vote
COR
2008
15 years 6 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
144
click to vote
DISOPT
2007
15 years 6 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
155
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...