Journal: Mathematical Programming

Found 797 papers in total
Interactions between nonlinear programming and modeling systems
Interactions between nonlinear programming and modeling systems
1997,
Modeling systems are very important for bringing mathematical programming software to...
Error bounds in mathematical programming
Error bounds in mathematical programming
1997,
Originated from the practical implementation and numerical considerations of iterative...
Recent progress in unconstrained nonlinear optimization without derivatives
Recent progress in unconstrained nonlinear optimization without derivatives
1997,
We present an introduction to a new class of derivative free methods for unconstrained...
Decomposition methods in stochastic programming
Decomposition methods in stochastic programming
1997,
Stochastic programming problems have very large dimension and characteristic...
A dual-active-set algorithm for positive semi-definite quadratic programming
A dual-active-set algorithm for positive semi-definite quadratic programming
1997,
Because of the many important applications of quadratic programming, fast and...
Cuts, matrix completions and graph rigidity
Cuts, matrix completions and graph rigidity
1997,
This paper brings together several topics arising in distinct areas: polyhedral...
Criss-cross methods: A fresh view on pivot algorithms
Criss-cross methods: A fresh view on pivot algorithms
1997,
Criss-cross methods are pivot algorithms that solve linear programming problems in one...
Logical analysis of numerical data
Logical analysis of numerical data
1997,
‘Logical analysis of data’ (LAD) is a methodology developed since the late...
A maximum b-matching problem arising from median location models with applications to the roommates problem
A maximum b-matching problem arising from median location models with applications to the roommates problem
1998,
We consider maximum b -matching problems where the nodes of the graph represent points...
Algorithms for railway crew management
Algorithms for railway crew management
1997,
Crew management is concerned with building the work schedules of crews needed to cover...
Discrete optimization in public rail transport
Discrete optimization in public rail transport
1997,
Many problems arising in traffic planning can be modelled and solved using discrete...
On the monotonization of polyhedra
On the monotonization of polyhedra
1997,
In polyhedral combinatorics one often has to analyze the facial structure of less than...
Measure concentration in optimization
Measure concentration in optimization
1997,
We discuss some consequences of the measure concentration phenomenon for optimization...
Fast deterministic approximation for the multicommodity flow problem
Fast deterministic approximation for the multicommodity flow problem
1997,
In this paper we consider an optimization version of the multicommodity flow problem...
A branch-and-cut algorithm for the equicut problem
A branch-and-cut algorithm for the equicut problem
1997,
We describe an algorithm for solving the equicut problem on complete graphs. The core...
The Steiner tree packing problem in VLSI design
The Steiner tree packing problem in VLSI design
1997,
In this paper we describe several versions of the routing problem arising in VLSI...
A polynomial time primal network simplex algorithm for minimum cost flows
A polynomial time primal network simplex algorithm for minimum cost flows
1997,
Developing a polynomial time primal network simplex algorithm for the minimum cost...
A new strongly polynomial dual network simplex algorithm
A new strongly polynomial dual network simplex algorithm
1997,
This paper presents a new dual network simplex algorithm for the minimum cost network...
A new pivot selection rule for the network simplex algorithm
A new pivot selection rule for the network simplex algorithm
1997,
We present a new network simplex pivot selection rule, which we call the minimum ratio...
On strongly polynomial dual simplex algorithms for the maximum flow problem
On strongly polynomial dual simplex algorithms for the maximum flow problem
1997,
Several pivot rules for the dual network simplex algorithm that enable it to solve a...
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
1997,
The dynamic tree> is an abstract data type that allows the maintenance of a...
How to compute least infeasible flows
How to compute least infeasible flows
1997,
It is well-known how to use maximum flow to decide when a flow problem with demands,...
Flows on hypergraphs
Flows on hypergraphs
1997,
We consider the capacitated minimum cost flow problem on directed hypergraphs. We...
Multiflows and disjoint paths of minimum total cost
Multiflows and disjoint paths of minimum total cost
1997,
In this paper we discuss a number of recent and earlier results in the field of...
Papers per page: