Journal: Mathematical Programming

Found 797 papers in total
Multi-constrained matroidal knapsack problems
Multi-constrained matroidal knapsack problems
1989,
The paper considers multi-constrained knapsack problems where the sets of elements to...
On the geometric structure of independence systems
On the geometric structure of independence systems
1989,
A bouquet of matroids is a combinatorial structure that generalizes the properties of...
On the supermodular knapsack problem
On the supermodular knapsack problem
1989,
In this paper the authors introduce binary knapsack problems where the objective...
Facets and algorithms for capacitated lot sizing
Facets and algorithms for capacitated lot sizing
1989,
The dynamic economic lot sizing model, which lies at the core of numerous production...
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications
1989,
The purpose of this paper is to introduce and study a new class of combinatorial...
Facets of the balanced (acyclic) induced subgraph polytope
Facets of the balanced (acyclic) induced subgraph polytope
1989,
A signed graph is a graph whose edges are labelled positive or negative. A signed...
Forest covers and a polyhedral intersection theorem
Forest covers and a polyhedral intersection theorem
1989,
A forest cover of a graph is a spanning forest for which each component has at least...
New lower bounds for the Symmetric Travelling Salesman Problem
New lower bounds for the Symmetric Travelling Salesman Problem
1989,
In this paper new lower bounds for the Symmetric Travelling Salesman Problem are...
Odd cycles and matrices with integrality properties
Odd cycles and matrices with integrality properties
1989,
A cycle of a bipartite graph G(V’+,V’-;E) is odd if its length is 2...
Four problems on graphs with excluded minors
Four problems on graphs with excluded minors
1989,
The four problems the authors consider are the Chinese postman, odd cut, co-postman,...
Algorithms for proportional matrices in reals and integers
Algorithms for proportional matrices in reals and integers
1989,
Let R be the set of nonnegative matrices whose row and column sums fall between...
Strong formulations for mixed integer programming: A survey
Strong formulations for mixed integer programming: A survey
1989,
The paper attempts to motivate and survey recent research on the use of...
The Boolean quadratic polytope: Some characteristics, facets and relatives
The Boolean quadratic polytope: Some characteristics, facets and relatives
1989,
The paper studies unconstrained quadratic zero-one programming problems having n...
Generalized polymatroids and submodular flows
Generalized polymatroids and submodular flows
1988,
Polyhedra related to matroids and sub- or supermodular functions play a central role...
Directed submodularity, ditroids and directed submodular flows
Directed submodularity, ditroids and directed submodular flows
1988,
Set relations and operations such as inclusion, union and intersection are generalized...
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
1988,
The authors address the problem of finding a minimum weight base B of a matroid when,...
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
1988,
A greedy algorithm solves the problem of maximizing a linear objective function over...
A simulation tool for the performance evaluation of parallel branch and bound algorithms
A simulation tool for the performance evaluation of parallel branch and bound algorithms
1988,
Parallel computation offers a challenging opportunity to speed up the time consuming...
Parallel quasi-Newton methods for unconstrained optimization
Parallel quasi-Newton methods for unconstrained optimization
1988,
We discuss methods for solving the unconstrained optimization problem on parallel...
Parallel optimization for traffic assignment
Parallel optimization for traffic assignment
1988,
Most large-scale optimization problems exhibit structures that allow the possibility...
An asynchronous parallel Newton method
An asynchronous parallel Newton method
1988,
A parallel Newton method is described for the minimization of a twice continuously...
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
1988,
Convergence is established for asynchronous parallel successive overrelaxation (SOR)...
Decomposition of linear programs using parallel computation
Decomposition of linear programs using parallel computation
1988,
This paper describes DECOMPAR: an implementation of the Dantzig-Wolfe decomposition...
Dual coordinate step methods for linear network flow problems
Dual coordinate step methods for linear network flow problems
1988,
The authors review a class of recently-proposed linear-cost network flow methods which...
Papers per page: