Sciweavers

530 search results - page 24 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
AAAI
2012
11 years 10 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
ORL
2008
116views more  ORL 2008»
13 years 7 months ago
Explicit gradient information in multiobjective optimization
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
Ubaldo M. García-Palomares, Juan C. Burguil...
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 8 days ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
TCS
2010
13 years 6 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
NHM
2010
83views more  NHM 2010»
13 years 2 months ago
Schwarz waveform relaxation algorithms for semilinear reaction-diffusion equations
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
Filipa Caetano, Martin J. Gander, Laurence Halpern...