Country: United States

Found 17049 papers in total
On a wide region of centers and primal–dual interior point algorithms for linear programming
On a wide region of centers and primal–dual interior point algorithms for linear programming
1997,
In the adaptive step primal–dual interior point method for linear programming,...
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
1997,
A generalized class of infeasible-interior-point methods for solving horizontal linear...
The zero duality gap property and lower semicontinuity of the perturbation function
The zero duality gap property and lower semicontinuity of the perturbation function
2002,
We examine the validity of the zero duality gap properties for two important dual...
A polyhedral study of integer variable upper bounds
A polyhedral study of integer variable upper bounds
2002,
We study the polyhedron of the single node capacitated network design model with...
The complexity of generic primal algorithms for solving general integer programs
The complexity of generic primal algorithms for solving general integer programs
2002,
Primal methods constitute a common approach to solving (combinatorial) optimization...
Combining problem structure with basis reduction to solve a class of hard integer programs
Combining problem structure with basis reduction to solve a class of hard integer programs
2002,
Recently Aardal et al . have successfully solved some small, difficult,...
A simplicial approach to the determination of an integer point of a simplex
A simplicial approach to the determination of an integer point of a simplex
1998,
We propose an algorithm to find an integer point of a simplex. The algorithm is based...
Integer solution for linear complementarity problem
Integer solution for linear complementarity problem
1998,
We consider the problem of finding an integer solution to a linear complementarity...
Persistency in 0–1 polynomial programming
Persistency in 0–1 polynomial programming
1998,
An optimal solution to the continuous relaxation of a mixed-integer 0–1 linear...
Integral solutions of linear complementarity problems
Integral solutions of linear complementarity problems
1998,
We characterize the class of integral square matrices M having the property that for...
On Barvinok's algorithm for counting lattice points in fixed dimension
On Barvinok's algorithm for counting lattice points in fixed dimension
1997,
We describe a simplification of a recent polynomial-time algorithm of A.I. Barvinok...
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
2002,
Probabilistic and stochastic algorithms have been used to solve many hard optimization...
Existence and discovery of average optimal solutions in deterministic infinite horizon optimization
Existence and discovery of average optimal solutions in deterministic infinite horizon optimization
1998,
We consider the problem of making a sequence of decisions, each chosen from a finite...
The compactness of a policy space in dynamic programming via an extension theorem for Caratheodory functions
The compactness of a policy space in dynamic programming via an extension theorem for Caratheodory functions
1997,
The background for this paper is a dynamic programming model with a Borel state space...
Hyperbolic polynomials and interior point methods for convex programming
Hyperbolic polynomials and interior point methods for convex programming
1997,
Hyperbolic polynomials have their origins in partial differential equations. We show...
On Vaidya's volumetric cutting plane method for convex programming
On Vaidya's volumetric cutting plane method for convex programming
1997,
We describe a simplified and strengthened version of Vaidya's volumetric cutting plane...
Asymptotic analysis for penalty and barrier methods in convex and linear programming
Asymptotic analysis for penalty and barrier methods in convex and linear programming
1997,
We consider a wide class of penalty and barrier methods for convex programming which...
Self-scaled barriers and interior-point methods for convex programming
Self-scaled barriers and interior-point methods for convex programming
1997,
This paper provides a theoretical foundation for efficient interior-point algorithms...
On the existence of subjective upper and lower probabilities
On the existence of subjective upper and lower probabilities
1997,
Consistency between preference under uncertainty modeled by Choquet expected utility...
A Monte Carlo approach to calculating probabilities for continuous identity by descent data
A Monte Carlo approach to calculating probabilities for continuous identity by descent data
2000,
Two related individuals are identical by descent at a genetic locus if they share the...
Classification of acceptance criteria for the simulated annealing algorithm
Classification of acceptance criteria for the simulated annealing algorithm
1997,
We present a complete and explicit description of the class of all acceptance criteria...
Global error bounds for convex multifunctions and applications
Global error bounds for convex multifunctions and applications
1998,
We give some results on the existence of global error bounds for convex multifunctions...
A fast parametric submodular intersection algorithm for strong map sequences
A fast parametric submodular intersection algorithm for strong map sequences
1997,
This paper presents a fast algorithm to solve the intersection problem for a pair of...
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
1997,
The paper presents two new combinatorial algorithms for the generalized circulation...
Papers per page: