Sciweavers

1404 search results - page 24 / 281
» Optimization problems in multiple-interval graphs
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
13 years 7 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
ATMOS
2010
172views Optimization» more  ATMOS 2010»
13 years 8 months ago
Column Generation Heuristic for a Rich Arc Routing Problem
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
Sébastien Lannez, Christian Artigues, Jean ...
IPL
2002
118views more  IPL 2002»
13 years 9 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 4 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
ICASSP
2011
IEEE
13 years 1 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski