Sciweavers

430 search results - page 43 / 86
» eor 2010
Sort
View
EOR
2002
87views more  EOR 2002»
14 years 9 months ago
On the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
Masakazu Kojima, Levent Tunçel
EOR
2008
100views more  EOR 2008»
14 years 8 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo
EOR
2010
140views more  EOR 2010»
14 years 7 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
101views more  EOR 2010»
14 years 10 months ago
Random yield supply chain with a yield dependent secondary market
Random yield affects production decisions and performances of all parties in a supply chain. We study a simple supply chain with one supplier and one retailer where there is rando...
Yuanjie He, Jiang Zhang
EOR
2010
145views more  EOR 2010»
14 years 10 months ago
Robust and data-driven approaches to call centers
We propose both robust and data-driven approaches to a fluid model of call centers that incorporates random arrival rates with abandonment to determine staff levels and dynamic ro...
Dimitris Bertsimas, Xuan Vinh Doan