| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5888071 | 2023-04-21 | Paper |
| How effective is aggregation for solving 0-1 models? | 2017-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2865879 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2865881 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867375 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2847609 | 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 | 2010-01-05 | Paper |
| A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes | 2009-06-17 | Paper |
| Note on implementing the new sphere method for LP using matrix inversions sparingly | 2009-02-17 | Paper |
| Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal | 2008-12-17 | Paper |
| A New Practically Efficient Interior Point Method for Convex Quadratic Programming | 2008-12-01 | Paper |
| Forecasting for Supply Chain and Portfolio Management | 2008-12-01 | Paper |
| A gravitational interior point method for LP. | 2008-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415351 | 2007-01-18 | Paper |
| Cone of recession and unboundedness of convex functions | 2002-11-13 | Paper |
| The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem | 2002-10-21 | Paper |
| Matchings in colored bipartite networks | 2002-08-29 | Paper |
| Facets of an assignment problem with 0-1 constraint | 2001-03-20 | Paper |
| Complementarity problems | 2001-01-25 | Paper |
| On the convergence of the block principal pivotal algorithm for the LCP | 2000-12-17 | Paper |
| A hybrid genetic/optimization algorithm for a task allocation problem | 1999-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247061 | 1999-06-16 | Paper |
| On the complexity of finding stationary points of nonconvex quadratic programs | 1999-05-31 | Paper |
| Adjacency on the constrained assignment problem | 1998-11-03 | Paper |
| Clustering problems in optimization models | 1997-01-22 | Paper |
| Segments in enumerating faces | 1996-07-24 | Paper |
| The Army Training Mix Model | 1995-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4310697 | 1994-10-31 | Paper |
| Studies of lexicography in the generalized network simplex method | 1994-05-05 | Paper |
| New iterative methods for linear inequalities | 1994-04-27 | Paper |
| On the complexity of a special basis problem in LP | 1994-04-17 | Paper |
| Exterior point algorithms for nearest points and convex quadratic programs | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142432 | 1993-12-12 | Paper |
| Note on combinatorial optimization with max-linear objective functions | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039868 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035630 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987192 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987194 | 1992-06-28 | Paper |
| CP-rays in simplicial cones | 1990-01-01 | Paper |
| The steepest descent gravitational method for linear programming | 1989-01-01 | Paper |
| Computational behavior of a feasible direction method for linear programming | 1989-01-01 | Paper |
| A correction to a result in linear programming | 1988-01-01 | Paper |
| Some NP-complete problems in quadratic and nonlinear programming | 1987-01-01 | Paper |
| The gravitational method for linear programming | 1986-01-01 | Paper |
| On \({\mathbb{K}}^{\Delta}\) | 1986-01-01 | Paper |
| A finite characterization ofK-matrices in dimensions less than four | 1986-01-01 | Paper |
| Intermediate feasibility in 0–1 integer linear systems | 1985-01-01 | Paper |
| Faces of a polyhedron | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795479 | 1985-01-01 | Paper |
| A feasible direction method for linear programming | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671749 | 1983-01-01 | Paper |
| Some NP-complete problems in linear programming | 1982-01-01 | Paper |
| A critical index algorithm for nearest point problems on simplicial cones | 1982-01-01 | Paper |
| A 1-matching blossom-type algorithm for edge covering problems | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316970 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320129 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3914784 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950326 | 1981-01-01 | Paper |
| Computational complexity of parametric linear programming | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864313 | 1979-01-01 | Paper |
| Computational complexity of complementary pivot methods | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101610 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4123077 | 1974-01-01 | Paper |
| The graph of an abstract polytope | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401222 | 1973-01-01 | Paper |
| On the number of solutions to the complementarity problem and spanning properties of complementary cones | 1972-01-01 | Paper |
| A fundamental problem in linear inequalities with applications to the travelling salesman problem | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5599446 | 1971-01-01 | Paper |
| Adjacency on Convex Polyhedra | 1971-01-01 | Paper |
| On a Characterization ofP-Matrices | 1971-01-01 | Paper |
| On the Tours of a Traveling Salesman | 1969-01-01 | Paper |
| Linear programming under uncertainty: A basic property of the optimal solution | 1968-01-01 | Paper |
| Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost | 1968-01-01 | Paper |
| Solving the Fixed Charge Problem by Ranking the Extreme Points | 1968-01-01 | Paper |
| An Algorithm for the Traveling Salesman Problem | 1963-01-01 | Paper |
