Journal: Mathematical Programming (Series A)

Found 506 papers in total
A probabilistic analysis of the multiknapsack value function
A probabilistic analysis of the multiknapsack value function
1990,
The optimal solution value of the multiknapsack problem as a function of the knapsack...
Facets of the clique partitioning polytope
Facets of the clique partitioning polytope
1990,
A subset A of the edge set of a graph is called a clique partitioning of G if there is...
Minimum-weight two-connected spanning networks
Minimum-weight two-connected spanning networks
1990,
The authors consider the problem of constructing a minimum-weight, two-connected...
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
1990,
This paper deals with multiobjective programming in which the objective functions are...
Recognition problems for special classes of polynomials in 0-1 variables
Recognition problems for special classes of polynomials in 0-1 variables
1989,
This paper investigates the complexity of various recognition problems for...
An inexact algorithm for composite nondifferentiable optimization
An inexact algorithm for composite nondifferentiable optimization
1989,
The paper describes an inexact version of Fletcher’s QL algorithm with...
Global convergence of Rosen’s gradient projection method
Global convergence of Rosen’s gradient projection method
1989,
The convergence of Rosen’s gradient method is a long-standing problem in...
Experiments in quadratic 0-1 programming
Experiments in quadratic 0-1 programming
1989,
The authors present computational experience with a cutting plane algorithm for 0-1...
An extension of Karmarkar’s projective algorithm for convex quadratic programming
An extension of Karmarkar’s projective algorithm for convex quadratic programming
1989,
The authors present an extension of Karmarkar’s linear programming algorithm for...
Generalized edge packings
Generalized edge packings
1989,
An extension of matchings is considered: instead of edges, odd length chains are used,...
An example of a nonregular semimontone Q-matrix
An example of a nonregular semimontone Q-matrix
1989,
In their paper, Aganagic and Cottle gave necessary and sufficient conditions for a P 0...
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
1989,
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...
On the facial structure of the set covering polytope
On the facial structure of the set covering polytope
1989,
Given a bipartite graph G=(V,U,E), a cover of G is a subset D⊆V with the property...
A probabilistic analysis of the switching algorithm for the Euclidean TSP
A probabilistic analysis of the switching algorithm for the Euclidean TSP
1989,
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean...
Valid inequalities and facets of the capacitated plant location problem
Valid inequalities and facets of the capacitated plant location problem
1989,
Recently, several successful applications of strong cutting plane methods to...
A randomized algorithm for fixed-dimensional linear programming
A randomized algorithm for fixed-dimensional linear programming
1989,
The authors give a (Las Vegas) randomized algorithm for linear programming in a fixed...
An extension of the simplex algorithm for semi-infinite linear programming
An extension of the simplex algorithm for semi-infinite linear programming
1989,
The authors present a primal method for the solution of the semi-infinite linear...
An implementation of Karmarkar’s algorithm for linear programming
An implementation of Karmarkar’s algorithm for linear programming
1989,
This paper describes the implementation of power series dual affine scaling variants...
Sequential convexification in reverse convex and disjunctive programming
Sequential convexification in reverse convex and disjunctive programming
1989,
This paper is about a property of certain combinatorial structures, called sequential...
On the Windy Postman Problem on Eulerian graphs
On the Windy Postman Problem on Eulerian graphs
1989,
The Windy Postman Problem (WPP) is defined as follows: Given an undirected connected...
Pure adaptive search in Monte Carlo optimization
Pure adaptive search in Monte Carlo optimization
1989,
Pure adaptive search constructs a sequence of points uniformly distributed within a...
Degeneracy in infinite horizon optimization
Degeneracy in infinite horizon optimization
1989,
The authors consider sequential decision problems over an infinite horizon. The...
Analysis of a class of fractional programming problems
Analysis of a class of fractional programming problems
1989,
The paper proposes a solution strategy for fractional programming problems of the form...
Convergence of interval-type algorithms for generalized fractional programming
Convergence of interval-type algorithms for generalized fractional programming
1989,
The purpose of this paper is to analyze the convergence of interval-type algorithms...
Papers per page: