Journal: Mathematical Programming

Found 797 papers in total
On implementing a primal–dual interior-point method for conic quadratic optimization
On implementing a primal–dual interior-point method for conic quadratic optimization
2003,
Based on the work of the Nesterov and Todd on self-scaled cones an implementation of a...
On the separation of split cuts and related inequalities
On the separation of split cuts and related inequalities
2003,
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities...
The merchant subtour problem
The merchant subtour problem
2003,
We consider the problem of a travelling merchant who makes money by buying commodities...
Rectilinear group Steiner trees and applications in very large scale integration design
Rectilinear group Steiner trees and applications in very large scale integration design
2003,
Given a set of disjoint groups of points in the plane, the rectilinear group Steiner...
On the capacitated vehicle routing problem
On the capacitated vehicle routing problem
2003,
We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles...
A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
2003,
We give a policy-improvement type algorithm to locate an optimal pure stationary...
Preemptive scheduling with rejection
Preemptive scheduling with rejection
2003,
We consider the problem of preemptively scheduling a set of n jobs on m (identical,...
Computing optimal preemptive schedules for parallel tasks: Linear programming approaches
Computing optimal preemptive schedules for parallel tasks: Linear programming approaches
2003,
We study the problem of scheduling a set of n independent parallel tasks on m...
Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach
Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach
2002,
This paper develops a polyhedral approach to the design, analysis, and computation of...
Detecting Jacobian sparsity patterns by Bayesian probing
Detecting Jacobian sparsity patterns by Bayesian probing
2002,
In this paper we describe an automatic procedure for successively reducing the set of...
Polyhedral results for two-connected networks with bounded rings
Polyhedral results for two-connected networks with bounded rings
2002,
We study the polyhedron associated with a network design problem which consists in...
A connection between cutting plane theory and the geometry of numbers
A connection between cutting plane theory and the geometry of numbers
2002,
In this paper, we relate several questions about cutting planes to a fundamental...
Self-regular functions and new search directions for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
2002,
In this paper, we introduce the notion of a self-regular function. Such a function is...
A decomposition procedure based on approximate Newton directions
A decomposition procedure based on approximate Newton directions
2002,
The efficient solution of large-scale linear and nonlinear optimization problems may...
Local behavior of an iterative framework for generalized equations with nonisolated solutions
Local behavior of an iterative framework for generalized equations with nonisolated solutions
2002,
An iterative framework for solving generalized equations with nonisolated solutions is...
Maximum stable set formulations and heuristics based on continuous optimization
Maximum stable set formulations and heuristics based on continuous optimization
2002,
The stability number α (G) for a given graph G is the size of a maximum stable...
A feasible semismooth asymptotically Newton method for mixed complementarity problems
A feasible semismooth asymptotically Newton method for mixed complementarity problems
2002,
Semismooth Newton methods constitute a major research area for solving mixed...
Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
2002,
The bounded multiple-class binary knapsack problem is a variant of the knapsack...
Two properties of condition numbers for convex programs via implicitly defined barrier functions
Two properties of condition numbers for convex programs via implicitly defined barrier functions
2002,
We study two issues on condition numbers for convex programs: one has to do with the...
Convex extensions and envelopes of lower semi-continuous functions
Convex extensions and envelopes of lower semi-continuous functions
2002,
We define a convex extension of a lower semi-continuous function to be a convex...
Convex optimization problems involving finite autocorrelation sequences
Convex optimization problems involving finite autocorrelation sequences
2002,
We discuss convex optimization problems in which some of the variables are constrained...
Generalized goal programming: Polynomial methods and applications
Generalized goal programming: Polynomial methods and applications
2002,
In this paper we address a general Goal Programming problem with linear objectives,...
Pruning by isomorphism in branch-and-cut
Pruning by isomorphism in branch-and-cut
2002,
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having...
An extended algorithm for separated continuous linear programs
An extended algorithm for separated continuous linear programs
2002,
Separated continuous linear programs (SCLP) are a class of continuous linear programs...
Papers per page: