60
Voted
MP
2002
14 years 8 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
69
Voted
MP
2002
14 years 8 months ago
2002
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...
59
Voted
MP
2002
14 years 8 months ago
2002
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...
70
Voted
MP
2002
14 years 8 months ago
2002
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...
59
Voted
MP
2002
14 years 8 months ago
2002
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...
82
Voted
MP
2002
14 years 8 months ago
2002
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...
72
Voted
MP
2002
14 years 8 months ago
2002
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...
67
Voted
MP
2002
14 years 8 months ago
2002
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...
64
Voted
MP
2002
14 years 8 months ago
2002
43
Voted
MP
2002
14 years 8 months ago
2002