Sciweavers

4377 search results - page 125 / 876
» Mass problems and randomness
Sort
View
IOR
2006
93views more  IOR 2006»
15 years 6 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
IOR
2006
173views more  IOR 2006»
15 years 6 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
NMA
2010
15 years 4 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 9 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
ISTCS
1993
Springer
15 years 10 months ago
The Minimum Reservation Rate Problem in Digital Audio/Video Systems
d Abstract) David P. Anderson Nimrod Megiddoy Moni Naorz April 1993 The \Minimum Reservation Rate Problem" arises in distributed systems for handling digital audio and video d...
Nimrod Megiddo, Moni Naor, David P. Anderson