Sciweavers

111 search results - page 8 / 23
» Finding Total Unimodularity in Optimization Problems Solved ...
Sort
View
CATS
2008
13 years 9 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CPAIOR
2006
Springer
13 years 11 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
ECAI
2010
Springer
13 years 8 months ago
LP Solvable Models for Multiagent Fair Allocation Problems
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
Julien Lesca, Patrice Perny
ISPD
2006
ACM
158views Hardware» more  ISPD 2006»
14 years 1 months ago
Effective linear programming based placement methods
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...
Sherief Reda, Amit Chowdhary