Sciweavers

410 search results - page 15 / 82
» Max and min limiters
Sort
View
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 7 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
ORL
1998
137views more  ORL 1998»
13 years 7 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans
JSAT
2008
83views more  JSAT 2008»
13 years 7 months ago
The First and Second Max-SAT Evaluations
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the ...
Josep Argelich, Chu Min Li, Felip Manyà, Jo...