Sciweavers

EOR
2010
101views more  EOR 2010»
13 years 5 months ago
A linear implementation of PACMAN
PACMAN (Passive and Active Compensability Multicriteria ANalysis) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensabili...
Silvia Angilella, Alfio Giarlotta, Fabio Lamantia
EOR
2010
159views more  EOR 2010»
13 years 5 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
EOR
2010
99views more  EOR 2010»
13 years 5 months ago
Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming
We analyze the problem of pricing and hedging contingent claims in the multi-period, discrete time, discrete state case using the concept of a sufficiently attractive expected gai...
Mustafa Ç. Pinar, Aslihan Salih, Ahmet Camc...
EOR
2010
140views more  EOR 2010»
13 years 8 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
EOR
2010
113views more  EOR 2010»
13 years 8 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
EOR
2010
104views more  EOR 2010»
13 years 8 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
EOR
2010
94views more  EOR 2010»
13 years 8 months ago
Queues with slow servers and impatient customers
Nir Perel, Uri Yechiali