default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 70
Volume 70, 1995
- András Prékopa, Wenzhong Li:
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function. 1-16 - Naveen Garg
, Vijay V. Vazirani:
A polyhedron with alls - t cuts as vertices, and adjacency of cuts. 17-25 - Katta G. Murty, Sung-Jin Chung:
Segments in enumerating faces. 27-45 - James E. Falk, Jiming Liu:
On bilevel programming, Part I: General nonlinear cases. 47-72 - Rüdiger Schultz:
On structure and stability in stochastic programs with random technology matrix and complete integer recourse. 73-89 - Asen L. Dontchev:
Implicit function theorems for generalized equations. 91-106 - Gongyun Zhao, Jishan Zhu:
The curvature integral and the complexity of linear complementarity problems. 107-122 - J. Frédéric Bonnans, Agnès Sulem:
Pseudopower expansion of solutions of generalized equations and constrained optimization problems. 123-148 - Alexander Shapiro:
Directional differentiability of the optimal value function in convex semi-infinite programming. 149-157 - Daniel Ralph, Stephan Dempe:
Directional derivatives of the solution of a parametric nonlinear program. 159-172 - J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. 173-190 - Siegfried Schaible, Jen-Chih Yao:
On the equivalence of nonlinear complementarity problems and least-element problems. 191-200 - András Frank, Zoltán Szigeti:
A note on packing paths in planar graphs. 201-209 - Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, George L. Nemhauser, Gabriele Sigismondi:
The fleet assignment problem: Solving a large-scale integer program. 211-232 - Jean-Pierre Dussault, Youssou Gningue:
Unification of basic and composite nondifferentiable optimization. 233-249 - Philip E. Gill, Walter Murray, Dulce B. Ponceleon, Michael A. Saunders:
Primal - dual methods for linear programming. 251-277 - James Renegar:
Linear programming, complexity theory and elementary functional analysis. 279-351
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:
