Sciweavers

1984 search results - page 56 / 397
» The colourful feasibility problem
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 10 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...
HEURISTICS
2007
165views more  HEURISTICS 2007»
13 years 10 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
DAM
1999
132views more  DAM 1999»
13 years 9 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
14 years 4 months ago
Human Age Estimation by Metric Learning for Regression Problems
Abstract. The estimation of human age from face images is an interesting problem in computer vision. We proposed a general distance metric learning scheme for regression problems, ...
Yangjing Long