Sciweavers

14165 search results - page 16 / 2833
» The generalized two-server problem
Sort
View
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 28 days ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
EJC
2000
13 years 7 months ago
The Generalized Baues Problem for Cyclic Polytopes I
Given an affine surjection of polytopes : P Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map has t...
Jörg Rambau, Francisco Santos
JGO
2010
96views more  JGO 2010»
13 years 5 months ago
Duality and optimality conditions for generalized equilibrium problems involving DC functions
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...
N. Dinh, Jean-Jacques Strodiot, Van Hien Nguyen
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 9 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz