researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
External Links
Journal: Math. Program.
Home
Index
Info
Volume
Volume
34
, Issue
3
251
--
264
William J. Cook
,
A. M. H. Gerards
,
Alexander Schrijver
,
Éva Tardos
.
Sensitivity theorems in integer linear programming
265
--
291
Richard E. Stone
.
Linear complementarity problems with an invariant number of solutions
292
--
301
Yahya Fathi
,
Craig A. Tovey
.
Affirmative action algorithms
302
--
332
Jacqueline Boucher
,
Yves Smeers
.
The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation
333
--
353
Hubertus Th. Jongen
,
P. Jonker
,
F. Twilt
.
Critical sets in parametric optimization
354
--
361
Rainer Hettich
.
An implementation of a discretization method for semi-infinite programming
362
--
369
J. Semple
,
Sanjo Zlobec
.
On the continuity of a Lagrangian multiplier function in input optimization
372
--
0
Donald Goldfarb
.
Efficient dual simplex algorithms for the assignment problem
Volume
34
, Issue
2
125
--
141
Michel L. Balinski
.
A competitive (dual) simplex method for the assignment problem
142
--
162
Patrice Marcotte
.
Network design problem with congestion effects: A case of bilevel programming
163
--
174
J. Ben Rosen
,
Panos M. Pardalos
.
Global minimization of large-scale constrained concave quadratic problems by separable programming
175
--
187
Krzysztof C. Kiwiel
.
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
188
--
200
Regina Hunter Mladineo
.
An algorithm for finding the global maximum of a multimodal, multivariate function
201
--
211
Chia-Shin Chung
.
On the stability of Invariant Capital Stock in a two-dimensional planning model
212
--
222
Daniel Granot
.
A generalized linear production model: A unifying model
223
--
231
Pierre Hansen
,
Brigitte Jaumard
,
Michel Minoux
.
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
232
--
234
Jonathan M. Borwein
,
D. Zhuang
.
On Fan's minimax theorem
235
--
238
P. W. Smith
,
Henry Wolkowicz
.
A nonlinear equation for linear programming
239
--
242
Philip C. Jones
.
Even more with the Lemke complementarity algorithm
243
--
247
Jerzy A. Filar
,
Todd A. Schultz
.
Nonlinear programming and stationary strategies in stochastic games
Volume
34
, Issue
1
1
--
33
Gilles Gastou
,
Ellis L. Johnson
.
Binary group and Chinese postman polyhedra
34
--
47
M. J. D. Powell
.
How bad are the BFGS and DFP methods when the objective function is quadratic?
48
--
61
William J. Cook
.
On box totally dual integral polyhedra
62
--
71
Charles Blair
.
Random linear programs with many variables and few constraints
72
--
83
Suvrajeet Sen
,
Hanif D. Sherali
.
Facet inequalities from simple disjunctions in cutting plane theory
84
--
110
Stephen Schecter
.
Structure of the first-order solution set for a class of nonlinear programs with parameters
111
--
124
Miranda Lundy
,
Alistair I. Mees
.
Convergence of an annealing algorithm