Sciweavers

Share
EMMCVPR
2011
Springer
7 years 3 months ago
Globally Optimal Image Partitioning by Multicuts
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Jörg H. Kappes, Markus Speth, Björn Andr...
TCAD
2011
7 years 10 months ago
GRIP: Global Routing via Integer Programming
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
COLING
2010
7 years 10 months ago
Fast, Greedy Model Minimization for Unsupervised Tagging
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
Sujith Ravi, Ashish Vaswani, Kevin Knight, David C...
EUSFLAT
2009
122views Fuzzy Logic» more  EUSFLAT 2009»
8 years 1 months ago
Production and Transportation Planning - A fuzzy Approach for Minimizing the Total Cost
Abstract-- In this paper, we deal with the production and transportation planning of a household appliances manufacturer that has production facilities and central stores for resel...
Heinrich J. Rommelfanger
ACL
2010
8 years 1 months ago
Minimized Models and Grammar-Informed Initialization for Supertagging with Highly Ambiguous Lexicons
We combine two complementary ideas for learning supertaggers from highly ambiguous lexicons: grammar-informed tag transitions and models minimized via integer programming. Each st...
Sujith Ravi, Jason Baldridge, Kevin Knight
IDA
2000
Springer
8 years 3 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
4OR
2004
90views more  4OR 2004»
8 years 3 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
MP
2006
119views more  MP 2006»
8 years 3 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
JAIR
2008
98views more  JAIR 2008»
8 years 3 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
EOR
2006
104views more  EOR 2006»
8 years 3 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
books