Sciweavers

73 search results - page 9 / 15
» ipco 2007
Sort
View
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 10 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
IPCO
2004
100views Optimization» more  IPCO 2004»
13 years 10 months ago
Valid Inequalities Based on Simple Mixed-Integer Sets
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
Sanjeeb Dash, Oktay Günlük
IPCO
2004
142views Optimization» more  IPCO 2004»
13 years 10 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
IPCO
2001
79views Optimization» more  IPCO 2001»
13 years 10 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin
IPCO
2001
125views Optimization» more  IPCO 2001»
13 years 10 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre