Sciweavers

1603 search results - page 10 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 4 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
ATMOS
2007
152views Optimization» more  ATMOS 2007»
14 years 11 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 4 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 10 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
CP
2009
Springer
15 years 4 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan