default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 14
Volume 14, Number 1, 1978
- Marion Lauriere:
An algorithm for the 0/1 Knapsack problem. 1-10 - Linus Schrage:
Implicit representation of generalized variable upper bounds in linear programming. 11-20 - Roy E. Marsten, Thomas L. Morin:
A hybrid approach to discrete mathematical programming. 21-40 - Bruce A. Murtagh, Michael A. Saunders:
Large-scale linearly constrained optimization. 41-72 - Jean-Baptiste Hiriart-Urruty:
On optimality conditions in nondifferentiable programming. 73-86 - B. T. Poljak:
Nonlinear programming methods in the presence of noise. 87-97 - C. Roger Glassey:
A quadratic network optimization model for equilibrium single commodity trade flows. 98-107 - H. Massam, Sanjo Zlobec:
Various definitions of the derivative in mathematical programming - an addendum. 108-111 - Michael J. Todd:
Bimatrix games - an addendum. 112-115 - Gérard Cornuéjols, George L. Nemhauser:
Tight bounds for christofides' traveling salesman heuristic. 116-121 - B. Curtis Eaves:
A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set. 122-124 - H. Peyton Young:
Power, prices, and incomes in voting systems. 129-148 - David F. Shanno, Kang-Hoh Phua:
Matrix conditioning and nonlinear optimization. 149-160 - Markku Kallio, Evan L. Porteus:
A class of methods for linear programming. 161-169 - Mordecai Avriel, Siegfried Schaible:
Second order characterizations of pseudoconvex functions. 170-185 - Donald K. Richter:
The computation of a general equilibrium in a public goods economy. 186-207 - Kaj Madsen, Hans Schjær-Jacobsen:
Linearly constrained minimax optimization. 208-223 - M. J. D. Powell:
Algorithms for nonlinear constraints that use lagrangian functions. 224-248 - Joseph G. Ecker
, Issoufou Kouada:
Finding all efficient extreme points for multiple objective linear programs. 249-261 - George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher:
An analysis of approximations for maximizing submodular set functions - I. 265-294 - Florent Cordellier, Jean-Charles Fiorot:
On the Fermat - Weber problem with convex cost functions. 295-311 - Christos H. Papadimitriou:
The adjacency relation on the traveling salesman polytope is NP-Complete. 312-324 - H. Paul Williams:
The reformulation of two mixed integer programming problems. 325-331 - Marvin D. Troutt:
Algorithms for non-convex Sn-games. 332-348 - Philip E. Gill, Walter Murray:
Numerically stable methods for quadratic programming. 349-372 - Martin Grötschel, Rabe von Randow:
A property of continuous unbounded algorithms. 373-377
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 2024-11-21 20:32 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:
