| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7677566 (Why is no real title available?) | 2023-04-21 | Paper |
How effective is aggregation for solving 0-1 models?
Opsearch | 2017-01-19 | Paper |
Sphere methods for LP
Algorithmic Operations Research | 2013-12-11 | Paper |
\(O(m)\) bound on number of iterations in sphere methods for LP
Algorithmic Operations Research | 2013-12-11 | Paper |
Fast descent methods for LPs with no matrix inversions
Algorithmic Operations Research | 2013-12-11 | Paper |
Infeasibility analysis for linear systems, a survey
The Arabian Journal for Science and Engineering. Section C: Theme Issues | 2013-09-11 | Paper |
| Computational and Algorithmic Linear Algebra and n-Dimensional Geometry | 2012-01-27 | Paper |
Optimization for decision making. Linear and quadratic models
International Series in Operations Research & Management Science | 2010-01-05 | Paper |
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
Optimization Letters | 2009-06-17 | Paper |
Note on implementing the new sphere method for LP using matrix inversions sparingly
Optimization Letters | 2009-02-17 | Paper |
Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal
Computers & Operations Research | 2008-12-17 | Paper |
Forecasting for Supply Chain and Portfolio Management
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
A New Practically Efficient Interior Point Method for Convex Quadratic Programming
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
A gravitational interior point method for LP.
Opsearch | 2008-03-19 | Paper |
| A new practically efficient interior point method for LP | 2007-01-18 | Paper |
Cone of recession and unboundedness of convex functions
European Journal of Operational Research | 2002-11-13 | Paper |
The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
Operations Research | 2002-10-21 | Paper |
Matchings in colored bipartite networks
Discrete Applied Mathematics | 2002-08-29 | Paper |
Facets of an assignment problem with 0-1 constraint
Journal of Combinatorial Optimization | 2001-03-20 | Paper |
Complementarity problems
Journal of Computational and Applied Mathematics | 2001-01-25 | Paper |
On the convergence of the block principal pivotal algorithm for the LCP
European Journal of Operational Research | 2000-12-17 | Paper |
A hybrid genetic/optimization algorithm for a task allocation problem
Journal of Scheduling | 1999-11-22 | Paper |
| scientific article; zbMATH DE number 1301842 (Why is no real title available?) | 1999-06-16 | Paper |
On the complexity of finding stationary points of nonconvex quadratic programs
Opsearch | 1999-05-31 | Paper |
Adjacency on the constrained assignment problem
Discrete Applied Mathematics | 1998-11-03 | Paper |
Clustering problems in optimization models
Computational Economics | 1997-01-22 | Paper |
Segments in enumerating faces
Mathematical Programming. Series A. Series B | 1996-07-24 | Paper |
The Army Training Mix Model
The Journal of the Operational Research Society | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 680244 (Why is no real title available?) | 1994-10-31 | Paper |
Studies of lexicography in the generalized network simplex method
Annals of Operations Research | 1994-05-05 | Paper |
New iterative methods for linear inequalities
Journal of Optimization Theory and Applications | 1994-04-27 | Paper |
On the complexity of a special basis problem in LP
Discrete Applied Mathematics | 1994-04-17 | Paper |
Exterior point algorithms for nearest points and convex quadratic programs
Mathematical Programming. Series A. Series B | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 446508 (Why is no real title available?) | 1993-12-12 | Paper |
Note on combinatorial optimization with max-linear objective functions
Discrete Applied Mathematics | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 192986 (Why is no real title available?) | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 176468 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 30946 (Why is no real title available?) | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 30948 (Why is no real title available?) | 1992-06-28 | Paper |
CP-rays in simplicial cones
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
The steepest descent gravitational method for linear programming
Discrete Applied Mathematics | 1989-01-01 | Paper |
Computational behavior of a feasible direction method for linear programming
European Journal of Operational Research | 1989-01-01 | Paper |
A correction to a result in linear programming
Discrete Applied Mathematics | 1988-01-01 | Paper |
Some NP-complete problems in quadratic and nonlinear programming
Mathematical Programming | 1987-01-01 | Paper |
The gravitational method for linear programming
Opsearch | 1986-01-01 | Paper |
A finite characterization ofK-matrices in dimensions less than four
Mathematical Programming | 1986-01-01 | Paper |
On \({\mathbb{K}}^{\Delta}\)
Discrete Applied Mathematics | 1986-01-01 | Paper |
Faces of a polyhedron
Mathematical Programming Essays in Honor of George B. Dantzig Part I | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4060990 (Why is no real title available?) | 1985-01-01 | Paper |
Intermediate feasibility in 0–1 integer linear systems
Mathematical Programming Essays in Honor of George B. Dantzig Part I | 1985-01-01 | Paper |
A feasible direction method for linear programming
Operations Research Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825556 (Why is no real title available?) | 1983-01-01 | Paper |
A critical index algorithm for nearest point problems on simplicial cones
Mathematical Programming | 1982-01-01 | Paper |
A 1-matching blossom-type algorithm for edge covering problems
Networks | 1982-01-01 | Paper |
Some NP-complete problems in linear programming
Operations Research Letters | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3850827 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3847228 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3726113 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3769360 (Why is no real title available?) | 1981-01-01 | Paper |
Computational complexity of parametric linear programming
Mathematical Programming | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3666550 (Why is no real title available?) | 1979-01-01 | Paper |
Computational complexity of complementary pivot methods
Mathematical Programming Studies | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3523317 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3548722 (Why is no real title available?) | 1974-01-01 | Paper |
The graph of an abstract polytope
Mathematical Programming | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3433636 (Why is no real title available?) | 1973-01-01 | Paper |
On the number of solutions to the complementarity problem and spanning properties of complementary cones
Linear Algebra and its Applications | 1972-01-01 | Paper |
A fundamental problem in linear inequalities with applications to the travelling salesman problem
Mathematical Programming | 1972-01-01 | Paper |
Adjacency on Convex Polyhedra
SIAM Review | 1971-01-01 | Paper |
On a Characterization ofP-Matrices
SIAM Journal on Applied Mathematics | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3320876 (Why is no real title available?) | 1971-01-01 | Paper |
On the Tours of a Traveling Salesman
SIAM Journal on Control | 1969-01-01 | Paper |
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
Operations Research | 1968-01-01 | Paper |
Solving the Fixed Charge Problem by Ranking the Extreme Points
Operations Research | 1968-01-01 | Paper |
Linear programming under uncertainty: A basic property of the optimal solution
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1968-01-01 | Paper |
An Algorithm for the Traveling Salesman Problem
Operations Research | 1963-01-01 | Paper |
