Sciweavers

2752 search results - page 73 / 551
» Rounding to an Integral Program
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 10 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
ENDM
2010
136views more  ENDM 2010»
13 years 8 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
MP
2006
78views more  MP 2006»
13 years 8 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
ATAL
2006
Springer
14 years 16 days ago
ACTIVE: agile coordinator testbed integrated virtual environment
This paper describes the specification, design and development of ACTIVE, a testbed for the testing and simulation of large-scale agent-based systems. ACTIVE is being developed as...
G. Emami, J. Cheng, D. Cornwell, M. Feldhousen, C....
FLOPS
2008
Springer
13 years 10 months ago
Integrating Answer Set Reasoning with Constraint Solving Techniques
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Veena S. Mellarkod, Michael Gelfond