Journal: Mathematical Programming

Found 797 papers in total
Shallow, deep and very deep cuts in the analytic center cutting plane method
Shallow, deep and very deep cuts in the analytic center cutting plane method
1999,
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable...
Characterization of the smoothness and curvature of a marginal function for a trust-region problem
Characterization of the smoothness and curvature of a marginal function for a trust-region problem
1999,
This paper studies the smoothness and curvature of a marginal function for a...
Asymptotic constraint qualifications and global error bounds for convex inequalities
Asymptotic constraint qualifications and global error bounds for convex inequalities
1999,
In this paper we study various asymptotic constraint qualifications for the existence...
Properties of the Moreau–Yosida regularization of a piecewise C2 convex function
Properties of the Moreau–Yosida regularization of a piecewise C2 convex function
1999,
In this paper we discuss second-order properties of the Moreau–Yosida...
Sample-path solution of stochastic variational inequalities
Sample-path solution of stochastic variational inequalities
1999,
Sample-path optimization is a simulation-based method for solving optimization...
Dual conditions characterizing optimality for convex multi-objective programs
Dual conditions characterizing optimality for convex multi-objective programs
1999,
Asymptotic necessary and sufficient conditions for a point to be a Pareto minimum, and...
A homotopy continuation method for solving normal equations
A homotopy continuation method for solving normal equations
1998,
In this paper, we present a continuation method for solving normal equations generated...
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
1998,
The D-gap function, recently introduced by Peng and further studied by Yamashita et...
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penality parameters
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penality parameters
1999,
A model algorithm based on the successive quadratic programming method for solving the...
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
1999,
In this paper we present several ‘infeasible-start’ path-following and...
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
1998,
In this paper we present a framework for solving stochastic programs with complete...
A branch and bound method for stochastic global optimization
A branch and bound method for stochastic global optimization
1998,
A stochastic branch and bound method for solving stochastic global optimization...
L-shaped decomposition of two-stage stochastic programs with integer recourse
L-shaped decomposition of two-stage stochastic programs with integer recourse
1998,
We consider two-stage stochastic programming problems with integer recourse. The...
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints
1999,
Introducing probabilistic constraints leads in general to nonconvex, nonsmooth or even...
Solving quadratric (0,1)-problems by semidefinite programs and cutting planes
Solving quadratric (0,1)-problems by semidefinite programs and cutting planes
1998,
We present computational experiments for solving quadratic (0, 1) problems. Our...
A sequential quadratic programming method for general nonlinear programs using only equality constrained subproblems
A sequential quadratic programming method for general nonlinear programs using only equality constrained subproblems
1998,
In this paper we describe a new version of a sequential equality constrained quadratic...
A bundle–Newton method for nonsmooth unconstrained minimization
A bundle–Newton method for nonsmooth unconstrained minimization
1998,
An algorithm based on a combination of the polyhedral and quadratic approximation is...
Approximating quadratic programming with bound and quadratic constraints
Approximating quadratic programming with bound and quadratic constraints
1999,
We consider the problem of approximating the global maximum of a quadratic program...
Approximability of flow shop scheduling
Approximability of flow shop scheduling
1998,
Shop scheduling problems are notorious for their intractability, both in theory and...
Makespan minimization in open shops: A polynomial time approximation scheme
Makespan minimization in open shops: A polynomial time approximation scheme
1998,
In this paper, we demonstrate the existence of a polynominal time approximation scheme...
Minimizing average completion time in the presence of release dates
Minimizing average completion time in the presence of release dates
1998,
A natural and basic problem in scheduling theory is to provide good average quality of...
Scheduling uniform machines on-line requires nondecreasing speed ratios
Scheduling uniform machines on-line requires nondecreasing speed ratios
1998,
We consider the following on-line scheduling problem. We have to schedule n...
Sequencing jobs that require common resources on a single machine: A solvable case of the traveling salesman problem
Sequencing jobs that require common resources on a single machine: A solvable case of the traveling salesman problem
1998,
In this paper a one-machine scheduling model is analyzed where n different jobs are...
Approximation algorithms for two-machine flow shop scheduling with batch setup times
Approximation algorithms for two-machine flow shop scheduling with batch setup times
1998,
In many practical situations, batching of similar jobs to avoid setups is performed...
Papers per page: