Journal: Mathematical Programming

Found 797 papers in total
A polynomial cycle canceling algorithm for submodular flow
A polynomial cycle canceling algorithm for submodular flow
1999,
Submodular flow problems, introduced by Edmonds and Giles, generalize network flow...
Inexact implicit methods for monotone general variational inequalities
Inexact implicit methods for monotone general variational inequalities
1999,
Solving a variational inequality problem is equivalent to finding a solution of a...
Stability of solutions to parameterized nonlinear complementarity problems
Stability of solutions to parameterized nonlinear complementarity problems
1999,
We consider the stability properties of solutions to parameterized nonlinear...
A note on the convergence of barrier algorithms to second-order necessary points
A note on the convergence of barrier algorithms to second-order necessary points
1999,
It has long been known that barrier algorithms for constrained optimization can...
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
1999,
We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling...
Random Linkage: A family of acceptance/rejection algorithms for global optimisation
Random Linkage: A family of acceptance/rejection algorithms for global optimisation
1999,
This paper introduces a new, infinite, class of stochastic algorithms for the...
Bound constrained quadratic programming via piecewise quadratic functions
Bound constrained quadratic programming via piecewise quadratic functions
1999,
We consider the strictly convex quadratic programming problem with bounded variables....
Continuity properties of the Karush–Kuhn–Tucker point set in quadratic programming problems
Continuity properties of the Karush–Kuhn–Tucker point set in quadratic programming problems
1999,
We obtain necessary and sufficient conditions for the set of the...
Testing optimality for quadratic 0–1 problems
Testing optimality for quadratic 0–1 problems
1999,
We test whether a given solution of a quadratic 0–1 problem is optimal. The...
A production–transportation problem with stochastic demand and concave production costs
A production–transportation problem with stochastic demand and concave production costs
1999,
Well known extensions of the classical transportation problem are obtained by...
Bimatrix games have quasi-strict equilibria
Bimatrix games have quasi-strict equilibria
1999,
In this paper we show that every bimatrix game has at least one quasi-strict...
Edge-augmentation of hypergraphs
Edge-augmentation of hypergraphs
1999,
Let G be a connected hypergraph. We give a min–max relation for the minimum...
Augmenting hypergraphs by edges of size two
Augmenting hypergraphs by edges of size two
1999,
We give a good characterization for the minimum number of edges of size two whose...
Covering symmetric supermodular functions by graphs
Covering symmetric supermodular functions by graphs
1999,
The minimum number of edges of an undirected graph covering a symmetric, supermodular...
Covering and structure of crossing families
Covering and structure of crossing families
1999,
Let ℱ be a symmetric and crossing family of subsets of V . Our first result is a...
Hypergraph connectivity augmentation
Hypergraph connectivity augmentation
1999,
The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet...
A 1-(S, T)-edge-connectivity augmentation algorithm
A 1-(S, T)-edge-connectivity augmentation algorithm
1999,
We present a combinatorial algorithm for the 1-( S, T )-edge-connectivity augmentation...
Directed vertex-connectivity augmentation
Directed vertex-connectivity augmentation
1999,
The problem of finding a smallest set of new edges to be added to a given directed...
How to make a graph four-connected
How to make a graph four-connected
1999,
Two extremal-type versions of the connectivity augmentation problem are investigated....
Increasing the rooted-connectivity of a digraph by one
Increasing the rooted-connectivity of a digraph by one
1999,
D.R. Fulkerson described a two-phase greedy algorithm to find a minimum cost spanning...
Successive edge-connectivity augmentation problems
Successive edge-connectivity augmentation problems
1999,
It was known that for undirected edge-connectivity (and for uniform demands) the...
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
1999,
In the edge connectivity augmentation problem one wants to find an edge of minimum...
Negative-cycle detection algorithms
Negative-cycle detection algorithms
1999,
We study the problem of finding a negative length cycle in a network. An algorithm for...
Composition duality and maximal monotonicity
Composition duality and maximal monotonicity
1999,
This paper shows how the Attouch–Théra duality principle for operator...
Papers per page: