Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IJMTM
2011
190views more  IJMTM 2011»
11 years 6 months ago
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
ICCV
2009
IEEE
11 years 9 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
MP
2006
119views more  MP 2006»
11 years 11 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
INFORMS
2006
87views more  INFORMS 2006»
11 years 11 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
EOR
2008
110views more  EOR 2008»
11 years 12 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
ICML
2010
IEEE
12 years 26 days ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
WSC
2004
12 years 1 months ago
New Advances and Applications for Marrying Simulation and Optimization
This tutorial will focus on several new real-world applications that have been developed using an integrated set of methods, including Tabu Search, Scatter Search, Mixed Integer P...
Jay April, Marco Better, Fred Glover, James P. Kel...
SPLC
2008
12 years 1 months ago
On SAT Technologies for Dependency Management and Beyond
SAT solvers technology is now mature enough to be part of the engineer toolbox side by side with Mixed Integer Programming and Constraint Programming tools. As of June 2008, two g...
Daniel Le Berre, Anne Parrain
IPCO
2007
143views Optimization» more  IPCO 2007»
12 years 1 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
IPCO
2008
136views Optimization» more  IPCO 2008»
12 years 1 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
books