GENERATING THE EFFICIENT OUTCOME SET IN MULTIPLE OBJECTIVE LINEAR PROGRAMS: THE BICRITERIA CASE
HAROLD P. BENSONCHARACTERIZATIONS OF BANACH SPACES VIA CONVEX AND OTHER LOCALLY LIPSCHITZ FUNCTIONS
J. BORWEIN, M. FABIAN, J. VANDERWERFFLP RELAXATIONS BETTER THAN CONVEXIFICATION FOR MULTICOMMODITY NETWORK OPTIMIZATION PROBLEMS WITH STEP INCREASING COST FUNCTIONS
V. GABREL, M. MINOUXREDUCTION OF MONOTONE LINEAR COMPLEMENTARITY PROBLEMS OVER CONES TO LINEAR PROGRAMS OVER CONES
M. KOJIMA, M. SHIDA, S. SHINDOHA PSEUDO-POLYNOMIAL ALGORITHM FOR SOLVING RANK THREE CONCAVE PRODUCTION-TRANSPORTATION PROBLEMS
TAKAHITO KUNOSOLUTION OF GENERAL LINEAR COMPLEMENTARITY PROBLEMS VIA NONDIFFERENTIABLE CONCAVE MINIMIZATION
O. L. MANGASARIANCONVEX ENVELOPES OF MULTILINEAR FUNCTIONS OVER A UNIT HYPERCUBE AND OVER SPECIAL DISCRETE SETS
HANIF D. SHERALICONVEX ANALYSIS APPROACH TO D. C. PROGRAMMING: THEORY, ALGORITHMS AND APPLICATIONS
PHAM DINH TAO, LE THI HOAI ANA NEW BOUNDING TECHNIQUE IN BRANCH-AND-BOUND ALGORITHMS FOR MIXED INTEGER PROGRAMMING
TRAN VU THIEU, TRAN XUAN SINHA RELAXATION ALGORITHM FOR SOLVING MIXED INTEGER PROGRAMMING PROBLEMS
NGUYEN VU TIEN, LE DUNG MUU