Sciweavers

MP
2002
48views more  MP 2002»
13 years 11 months ago
Maximum stable set formulations and heuristics based on continuous optimization
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
Samuel Burer, Renato D. C. Monteiro, Yin Zhang
MP
2002
105views more  MP 2002»
13 years 11 months ago
Local behavior of an iterative framework for generalized equations with nonisolated solutions
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 F(z) + T (z), where T is a multifu...
Andreas Fischer
MP
2002
86views more  MP 2002»
13 years 11 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
MP
2002
93views more  MP 2002»
13 years 11 months ago
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
Alexander Shapiro, Tito Homem-de-Mello, Joocheol K...
MP
2002
84views more  MP 2002»
13 years 11 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
MP
2002
143views more  MP 2002»
13 years 11 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
MP
2002
165views more  MP 2002»
13 years 11 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
MP
2002
85views more  MP 2002»
13 years 11 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
MP
2002
54views more  MP 2002»
13 years 11 months ago
A spectral bundle method with bounds
Christoph Helmberg, Krzysztof C. Kiwiel