default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 46
Volume 46, 1990
- Richard H. Byrd, Cornelius L. Dert, Alexander H. G. Rinnooy Kan, Robert B. Schnabel:
Concurrent Stochastic Methods for Global Optimization. 1-29 - Elsie Sterbin Gottlieb, M. R. Rao:
The Generalized Assignment Problem: Valid Inequalities and Facets. 31-52 - Elsie Sterbin Gottlieb, M. R. Rao:
(1, k)-Configuration Facets for the Generalized Assignment Problem. 53-60 - Yinyu Ye:
A "Build-Down" Scheme for Linear Programming. 61-72 - Bahman Kalantari:
Karmarkar's Algorithm with Improved Steps. 73-78 - Cees Roos:
An Exponential Example for Terlaky's Pivoting Rule for the Criss-Cross Simplex Method. 79-84 - Hui Hu:
A One-Phase Algorithm for Semi-Infinite Linear Programming. 85-103 - Krzysztof C. Kiwiel:
Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization. 105-122 - Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Monotropic Programs. 127-151 - Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank:
Minimum-Weight Two-Connected Spanning Networks. 153-171 - Miroslav D. Asic, Vera V. Kovacevic-Vujcic, Mirjana D. Radosavljevic-Nikolic:
Asymptotic Behaviour of Karmarkar's Method for Linear Programming. 173-190 - Renpu Ge:
A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables. 191-204 - Mordechai I. Henig:
Value Functions, Domination Cones and Proper Efficiency in Multicriteria Optimization. 205-217 - R. Chandrasekaran, Arie Tamir:
Algebraic Optimization: The Fermat-Weber Location Problem. 219-224 - Frieda Granot, Jadranka Skorin-Kapov:
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm. 225-236 - M. Meanti, A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis:
A Probabilistic Analysis of the Multiknapsack Value Function. 237-247 - Rainer Hettich, Günther Gramlich:
A Note on an Implementation of a Method for Quadratic Semi-Infinite Programming. 249-254 - Jiri Rohn:
A Short Proof of Finiteness of Murty's Principal Pivoting Algorithm. 255-256 - Jan Karel Lenstra, David B. Shmoys
, Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines. 259-271 - Andrew R. Conn, Gérard Cornuéjols:
A Projection Method for the Uncapacitated Facility Location Problem. 273-298 - Colin McDiarmid:
On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming. 299-320 - Panos M. Pardalos, N. Kovoor:
An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds. 321-328 - M. Seetharama Gowda, Thomas I. Seidman:
Generalized Linear Complementarity Problems. 329-340 - Kazufumi Ito, Karl Kunisch:
The Augmented Lagrangian Method for Equality and Inequality Constraints in Hilbert Spaces. 341-360 - Martin E. Dyer, Alan M. Frieze:
On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. 361-378 - George L. Nemhauser, Laurence A. Wolsey:
A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. 379-390 - Stella Dafermos:
Exchange Price Equilibria and Variational Inequalities. 391-402 - Bernd Luderer, Roland Rösiger:
On Shapiro's Results in Quasidifferential Calculus. 403-407
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
