LAST UPDATE: August 12, 1994 MATHEMATICAL PROGRAMMING SYMPOSIUM PLENARY SESSION -MG1 W. Cook Large scale combinatorial optimization R. Wets ' . . . the real problem' (George B. Dantzig) TUTORIALS R.E. Bixby - MH1 The simplex method: The computational state of the art D. Saari - MH2 Using dynamical chaos to explain voting and statistical paradoxes C. Gonzaga - MJ1 Interior and path following methods for LP A. Griewank - MJ2 Computational differentiation and optimization W. Murray - TB1 Algorithms for large nonlinear programming problems A. Frank - TB2 Connectivity augmentation problems in network design L. Vandenberghe - TE1 Positive-definite programming J. Holland - TE2 Can there be a unified theory of complex adaptive systems? J. Nocedal - WB1 Recent adances in large-scale nonlinear optimization G. Cornuejols - WB2 Balanced matrices P.M. Pardalos - WH1 On the passage from local to global in optimization L. Lovasz - WH2 Number theory, the algebra of polynomials, M and MP N. Karmarkar - RB1 A new parallel architecture for scientific computing based on finite projective geometries J. Mulvey - RB2 Financial planning via multi-stage stochastic programs S. Smale - RE1 Newton methods and complexity R.T. Rockafellar RE2 Nonsmooth Optimization R. Karp - FB1 Approximate solutions to NP-optimization problems U. Karmarkar - FB2 Mathematical programming and manufacturing management G.L. Nemhauser - FE1 Branch-and-cut: column generation for solving huge integer programs P. Toth - FE2 Routing and transit APPROXIMATION TO NP-OPT. PROBLEMS SESSION 1: Approximation to NP-Opt. Problems - J. Grabowski (FA9) D. Wedelin An approximation algorithm for large scale 0/1 integer programming K. Compton Logical definability and aysmptotic growth in optimization and counting problems J. Grabowski New results in the worst case analysis of approximation algorithms for scheduling problems SESSION 2: Approximation to NP-Opt. Problems - D. Bertsimas (FC9) Y.-L. Chou Approximately shortest paths in large scale networks: algorithms and probabilistic analysis M. Shigeno Approximate cost splitting algorithm for minimum cost submodular flow D. Bertsimas From valid inequalities to heuristics: a unified view of primal dual methods in approximation algorithms SESSION 3: Approximation to NP-Opt. Problems - M. Sudan (FD9) M. Bellare Improved non-approximability results D.S. Hochbaum Approximation algorithms for network design problems on bounded subsets V. Kann The approximability of satisfying subsystems of linear systems SESSION 4: Approximation to NP-Opt. Problems - M. Sudan (FF9) D.B. Shmoys Approximation algorithms for the network inhibition problem S. Khanna On syntactic versus computational views of approximability M. Thakur The descriptive complexity of NP-optimization and #P problems BI-LEVEL PROGRAMMING SESSION 1: Bi-level Programming - M.G. Nicholls (FD11) G. Savard Approximation of nonlinearly constrained bi-level programs M.G. Nicholls The application of bi-level non-linear programming to the aluminum industry Blank Spot SESSION 2: Bi-level Programming - J.J. Judice (FF11) L.N. Vicente The discrete linear bilevel programming problem P. Calamai On solving the nonlinear bilevel programming problem G. Savard A bilevel model of taxation COMBINATORICS SESSION 1: Combinatorics - A. Kelmans (FA17) Blank Spot A. Shioura An optimal enumeration of spanning trees in an undirected graph A. Kelmans Optimal packing of induced stars in a graph COMBINATORIAL OPTIMIZATION AND APPLICATIONS SESSION 1: Quadratic 0-1 Optimization I - P.L. Hammer (MC11) T. Badics Minimization of half-products H. Titan Ground state magnetizations of the Ising model for spin glasses B. Cunningham A polyhedral approach to maximum 2-satisfiability SESSION 2: Quadratic 0-1 Optimization I - E. Boros (MI11) N. Maculan An algorithm for the minimization of an indefinite quadratic function over a box H. Titan Image segmentation as a poly-time quadratic 0-1 problem H.P. Williams The 2-period traveling salesman problem: an integer programming model for milk collection in Ireland SESSION 3: Quadratic 0-1 Optimization in Computer Engineering - P.L. Hammer (TA11) M. Bushnell Automatic circuit redsign for delay fault testability using constrained quadratic 0-1 programming F. Rendl Two-dimensional cutting problems and electrical transformers S. Areibi A unified partitioning and placement approach based on tabu search algorithm SESSION 4: Nonlinear 0-1 Optimization - E. Boros (TC11) S. Elloumi A new lower bound for the minimization of a nonlinear pseudo-boolean function subject to linear constraints Y. Crama Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems D. Rader Quadratic knapsack problems SESSION 5: Networks - Y. Crama (TD11) L. Hall Designing a centralized processing network: formulation and computations K-i. Tokoro An efficient algorithm for optimal network design with discrete line speed M. Iri An essay in the theory of uncontrollable flows and congestion SESSION 6: Mathematics of Industrial Systems - Y. Crama (TF11) C. Helmberg Cutting aluminum coils with high length variabilities J. Leung Discrete deterministic and stochastic blending problems with two quality characteristics: aluminum blending J. Mazzola Optimal resource allocation under capacity-based economies and diseconomies of scope SESSION 7: Scheduling - J. Mazzola (WA11) F.C.R. Spieksma A polynomial algorithm for a multiprocessor scheduling problem with a small number of job lengths N. Hall Scheduling in robotic cells J. van de Klundert Cyclic scheduling of identical parts in a robotic cell SESSION 8 : Combinatorial Optimization and Applications - J. Leung (WC11) J.-M. Cao Continuous numerical algorithm for a class of combinatorial optimization problems T. Ibaraki Vehicle scheduling on a tree with release and handling times J. Leung The two level uncapacitated facility location problem SESSION 9: Combinatorial Optimization and Applications - M. Avriel (RA11) M. Mueller-Hannemann Using network flows for mesh generation and density control A. Abdel-Hamid Storage assignment problem in flexible manufacturing M. Avriel On the minimum shifting problem in container ship stowage SESSION 10: Combinatorial Optimization and Applications - U.T. Zimmermann (RC11) E. de Klerk Optimization of a reloading pattern in a nuclear reactor M.J.F. Trigueiros Boolean vector minimization and polyhedral projections U.T. Zimmermann On the complexity of cycle canceling for submodular flows SESSION 11: The Quadratic Assignment Problem - Y. Yajima (WC6) J. Clausen Parallel solution of large QAP problems S.E. Karisch Lower bounds for the quadratic assignment problem Y. Yajima Calculating sub-optimal solutions of quadratic assignment problems by global optimization approach SESSION 12: Knapsack Problems - M. Hartmann (RA6) D.S. Hochbaum The nonlinear knapsack problem I.R. de Farias On the continuous multiple-choice knapsack problem M. Hartmann Sequential Knapsack Problems SESSION 13: Combinatorial Optimization and Applications - R. Chandrasekaran (RC6) P. Jaillet On-line searching of graphs and lattices G. Galambos On-line data compression P. Hansen Solution of the multisource Weber problem by column generation with global optimization SESSION 14: Combinatorial Optimization and Applications - P. Martin (RD6) L.L. Gardner A polynomial time algorithm for minimum weight cycles in twirl-wheel graphs T. Asano Constructing a bipartite graph of maximum connectivity with prescribed degrees P. Martin The overall minimum cut in undirected planar graphs with non-negative edge costs SESSION 15: Combinatorial Optimization and Applications - A.S. Schulz (RF6) D. Johnson Running time vs. tour quality for the traveling salesman problem V. Chandru The Hopfield net loading problem is tractable A.S. Schulz Parallel machine unit time scheduling SESSION 16 Combinatorial Optimization and Applications - K. Murota (FA6) P. Klein A randomized linear-time algorithm for finding minimum spanning trees E. Korach On integral duality in the Chinese postman problem K. Murota Combinatorial relaxation algorithm for the maximum degree of subdeterminants SESSION 17: Combinatorical Optimization and Applications - K. Cameron - (FF22) K. Cameron Coflow and the travelling preacher problem J. Edmonds RAH for Farkas A.R. Mahjoub On the 2-edge connected subgraph polytope COMMITTEE ON STOCHASTIC PROGRAMMING SESSION 1: Stochastic Programming - S.P. Uryasev (MI15) B. Miller Observation control for discrete- continuous stochastic control X. Dong Estimating density function via constrained maximum likelihood method S.P. Uryasev Analytic perturbation analysis for discrete event dynamic systems SESSION 2: Stochastic Programming - Y. Ermoliev (TA15) R. Lepp Discrete stability in Stochastic programming J. Dupacova Post optimality analysis for scenario based stochastic linear programs J. Liu Extensions of algorithm sensitivity calculations in nonlinear programming using barrier and penalty functions SESSION 3: Stochastic Programming - A. King (TC15) K. Mosler An algorithm for multivariate weak stochastic dominance S. Sen Duality and statistical tests of optimality for two stage stochastic programs A. King A multistage stochastic programming interface system SESSION 4: Stochastic Programming - Y. Ermoliev (TD15) T. Fan Neural computing stochastic programming with recourse B. Dimitrov Stochastic optimization problems under incomplete information Y. Ermoliev On stochastic and discontinuous optimization methods SESSION 5: Stochastic Programming - A. Ruszczynski (TF15) D. Bertsimas A mathematical programming approach to stochastic and dynamic optimization problems A. Ruszczynski On augmented Lagrangian decomposition methods for stochastic optimization problems K. Frauendorfer On the implementation of barycentric approximation SESSION 6: Stochastic Programming - D. Holmes (WA15) E. Schweitzer A Gaussian upper bound for Gaussian multi-stage stochastic linear programs O. Fiedler Bounding in multi-period stochastic programming D. Holmes Bounding the value of an approximate solution in stochastic programming with recourse SESSION 7: Stochastic Programming - M. van der Vlerk (WC15) A.A. Gaivoronski Integer stochastic programming algorithms with applications to telecommunication networks M. van der Vlerk An efficient algorithm to compute the convex hull of a simple integer recourse program G. Infager A valid probabilistic lower bound for two-stage stochastic linear programs SESSION 8: Stochastic Programming - A. Prekopa (RA15) R.K. Cheung SHAPE: the successive hybrid approximation procedure N. Growe Nonparametric estimators for stochastic programs with probabilistic constraints A. Prekopa Programming under probabilistic constraint with discrete random variables SESSION 9: Stochastic Programming - M.A.H. Dempster (RC15) D.P. Morton A sampling based algorithm for two-stage stochastic programming A. King Simulating empirical distributions for multistage stochastic programs M.A.H. Dempster An EVPI-based sampling algorithm for large scale dynamic stochastic programming SESSION 10: Stochastic Programming - C. Edirisinghe (RD15) K. Frauendorfer Barycentric approximation in financial decision making M.J. Saltzman Massively parallel Bender's decomposition for stochastic programming on the CM-5 C. Edirisinghe Solving mulitstage stochastic programming models of portfolio selection with outstanding liabilities SESSION 11: Stochastic Programming - A. Kibzun (FF12) Y.S. Kan On the quantile minimization A.V. Naumov Linear two-stage quantile optimization problems A. Kibzun Statistical estimates and two-sided deterministic bounds for quantile function COMPUTATIONAL CHEMISTRY SESSION 1: Computational Chemistry- R.B. Schnabel (WC4) R.B. Schnabel Global optimization methods for molecular conformation problems M. Zheng Integer programming, Fullereness, and Nanotubes M.H. Wright Constrained optimization techniques for the protein folding problem CONSTRAINED APPROXIMATION, ABSTRACT OPTIMIZATION SESSION 1: Constrained Approximations - K. Compton (RD12) W. Li Surface reconstruction by constrained approximation P.W. Smith Shape preservation using splines I. Nowak (Dr. Nowak will not attend, but copies of the paper to be distributed.) Approximation of minimal surfaces in Riemannian manifolds of constant curvature by a nonlinear optimization method SESSION 2: Constrained Approximations - V.A. Ubhaya (RF12) A. Dontchev Computation of constrained best approximations J.M. Borwein Maximum entropy methods and infinite dimensional convex programming J. Ward Generalized Hermite interpolation with constraints CONVEX PROGRAMMING SESSION 1: Convex Programming - R. Polyak (MC21) J. Gauvin Degeneracy, normality, and stability in mathematical programming P. Tobin Convergence in primal-dual algorithms for convex programming using constraint set manipulation R. Polyak The "hot-start" phenomena in constrained optimization SESSION 2: Convex Programming 1 - A. Fischer (MI21) W.T. Obuchowska Problem of unboundedness of convex functions W. Li Differentiable exact penalty functions via Hestenes-Powell-Rockafellar's augmented Lagrangian function A. Fischer A Newton-type method for sparse quadratic programming problems SESSION 3: Convex Programming - A. Auslender (TA21) K.D. Andersen A Newton barrier method for minimizing a sum of norms subject to linear equality constraints and an efficient method to handle the L1 penalty function W. W. Hager Dual active set algorithm for linear programming A. Auslender An interior - proximal method for convex linearly constrained problems and its extension to variational inequalities SESSION 4: Quadratic Programming - L.M. Fernandes (TC21) M. Ben-Daya A hybrid decomposition approach for convex quadratic programming K. Al-Sultan A new exterior point approach for a class of convex quadratic programs L.M. Fernandes Block strategies in active-set algorithms for quadratic programming SESSION 5: Convex Programming - V. Venets (TD21) I. Litvinchev Bounds on the effect of aggregating variables in convex programming problems R. Monteiro On the existence and convergence of the central path for convex programming V. Venets Continuous optimization algorithms and their finite convergence in convex cases SESSION 6: Convex Programming - R. Mifflin (TF21) W.T. Obuchowska Minimal representation of convex regions D.L. Jensen The convergence of a modified barrier method for convex programming R. Mifflin A space decomposition algorithm for convex minimization SESSION 7: Convex Programming - K. Kiwiel (WA21) T. Jefferson Constraint estimation for convex optimization B.F. Svaiter A row-action method for convex programming K. Kiwiel Global convergence of some cutting plane methods using analytic centers for convex minimization SESSION 8: Generalized Proximal Point Methods in Optimization - A. Iusem (WC21) G. Chen A proximal-based decomposition method for convex minimization problems R. Polyak Nonlinear rescaling principle and entropy-like prox-methods in constrained optimization P. Eggermont Approximate proximal point methods for convex programming problems SESSION 9: Convex Programming - A. Kusraev (RA21) D.M. Ryan An optimization approach to seniority preferential bidded planning M.V. Ramana Quadratic maps with convex images A. Kusraev Nonstandard methods in convex analysis CUTTING PLANES SESSION1: Cutting Planes - M.V. Ramana (FD18) Blank Spot O. Khamisov A cutting plane method for global minimization of a function with concave minorant M.V. Ramana Cutting plane techniques in multiquadtratic programming DEGENERACY SESSION 1: Degeneracy - B. Hattersley (MC16) M. Osborne Aspects of degeneracy in linear programming C. Roos The optimal partition of a linear programming problem and its relevance for reliable sensitivity analysis B. Hattersley Practical techniques for countering degeneracy in linear programming SESSION 2: Degeneracy - K.G. Murty (MI16) S. Duffuaa Degeneracy, More-for-less and decomposition J. Mrazek Degenerate graphs: a modified n-tree method for solving the neighborhood problem K.G. Murty Segments in enumerating edges SESSION 3: Degeneracy - T. Terlaky (TA16) T. Tsuchiya Degeneracy and the affine scaling algorithm R.D.C. Monteiro Local convergence of interior point algorithms for degenerate LCP T. Terlaky Degeneracy in interior point methods for linear programming SESSION 4: Degeneracy - P. Tseng (TC16) S.R. Mohan On the degeneracy subgraph of Lemke's algorithm and an anti-cycling rule P. Calamai Resolving degeneracy in an exact penalty function technique for nonlinear bilevel optimization P. Tseng On the linear convergence of iterative methods for linear/nonlinear optimization without nondegeneracy assumption DEGREE THEORY SESSION 1: Degree Theory and Complementarity Problems - M.S. Gowda (TF8) J.-S. Pang A degree-theoretic approach to sensitivity and stability analysis of variational inequalities and complementarity problems M.S. Gowda Two stability principles and their applications M. Fukushima Equivalence of some complementarity problems to differentiable minimization: A unified approach DESIGN OPTIMIZATION SESSION 1: Design Optimization - J. Rao (MC18) R.S. Krishnamachari A note on use of decomposition methods for parametric studies in optimal design J. Rao Parametric deformation and game-theoretic modeling in design applications J. Dauer Construction of the set of objective values in multiple objective linear programs SESSION 2: VLSI and circuits C.C. Ribeiro (MI18) P.V. Kamesam An optimization based system for placement in VLSI physical design C.C. Ribeiro A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinatorial circuits M. Hillier Models for manufacturing system design: optimal operation assignment and product grouping SESSION 3: Multi-disciplinary Optimization - J. Dennis (TA18) J. Dennis Multidisciplinary optimization P. Frank Application of multidisciplinary design optimization formulation theory to a wing design problem N. Alexandrov Multilevel optimization algorithms for aircraft design SESSION 4:Useful Nonstandard Methods - J. Dennis (TC18) C.T. Kelley Implicit filtering and noisy optimal design problems V. Torczon A unifying abstraction for pattern search methods A.J. Kearsley An algorithm for optimizing the shape of an airfoil SESSION 5: Design Optimization - E. Polak (TD18) P. Tiwari A cost function for road construction based on engineering design parameters: a multiobjective optimization modeling framework K. Schittkowski SQP versus SCP methods for structural design optimization E. Atrek Generalized topological shape optimization of continuum structures SESSION 6: Design Optimization - K. Schittkowski (TF18) P. Kirkegaard Application of regularization and nonlinear programming techniques to predict cavity distributions in materials J. Wang Mathematical methods in multiobjective engineering design M.J.D. Powell Curve fitting by thin plate splines SESSION 7: Design Optimization - S.A. Nelson (WA18) M. Chirehdast Topology optimization of planar cross-sections H.T. Loh Optimization of water distribution systems in high-rise buildings H. Chickermane A new algorithm for structural optimization problems SESSION 8: Design Optimization - N. Tzannetakis (WC18) M.J. Jakiela Evolutionary and biological metaphors for engineering design N. Michelena Optimal system design and the product development process N. Tzannetakis Development of optimal design methodologies for engine air management systems DIMACS CHALLENGE SESSION 1: Colorings - A. Mehrotra (RF17) O. Marcotte Fractional and integral colorings A. Panconesi On the distributed approximation of edge coloring A. Mehrotra A column generation approach for exact graph coloring SESSION 2: Finding Cliques in Graphs - M.A. Trick (FC17) E. Balas Variations on a matching based clique finding procedure J.-M. Bourjolly A quadratic 0-1 optimization algorithm for the maximum clique and stable set problems L. Gibbons An exact algorithm for the maximum clique problem with accelerated pruning SESSION 3: Coloring Graphs - M.A. Trick (FD17) J. Culberson Iterated greedy graph coloring and the coloring landscape C. Morgenstern Distributed coloration neighborhood search G. Lewandowski Experiments on parallel graph coloring and applications SESSION 4: Algorithms for Satisfiability - M.A. Trick (FF17) M.G.C. Resende A GRASP for satisfiability Y. Wang Computational results on an LP and rounding approach to max 2SAT C. Ferland Object oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability EMPIRICAL EVALUATION SESSION 1: Empirical Evaluation - J. Hooker (FD5) M. Fleischer Information theory and the finite-time behaviour of the simulated annealing algorithm: experimental results C. McGeoch Graphical methods for assessing functional relationships J. Hooker An empirical study of branching rules for satisfiability SESSION 2: Test Problems for Computational Experiments - J.L. Arthur (MC15) J. More' Model problems for large scale optimization P.M. Pardalos Test problem generation for global and combinatorial optimization J.L. Arthur Random generation of structured linear optimization problems FINANCE SESSION 1: Finance -- J.M. Izquierdo (FA12) H. Konno A mean-absolute deviation model for bond-stock portfolio optimization S. Murray Scenario-building considerations for financial planning models J.M. Izquierdo Financial problems and cooperation SESSION 2: Finance - M.A.H. Dempster (FC12) M. Bosch-Princep Investment portfolio of a pension fund: stochastic model T. Koc Use of AHP method in investment evaluation of advanced technology M.A.H. Dempster Fast pricing of American options by linear programming SESSION 3: Finance - D.L. Jensen (FD12) A.J. King Stochastic programming for strategic portfolio management E. Rolland Constrained genetic search for real numbers: applications to portfolio selection problems with higher moments D.L. Jensen Portfolio optimization and mixed integer quadratic programming GAME THEORY SESSION 1: Game Theory - B. von Stengal (RD11) Blank Spot W.F. Lucas Mathematical programming in multiperson cooperative games B. von Stengal Exponentially faster algorithms for solving extensive games SESSION 2: Game Theory - T. Driessen (RF11) I. Dragan Potential bases for some linear values of cooperative LU games T. Solymosi On computing the nucleolus of a balanced connected game T. Driessen Egalitarism of the prenucleolus for cooperative games SESSION 3: Game Theory - F. Thuijsman (FA11) A. Nowak Continuous time stochastic markov games J. Tind Packing games with multiple criteria F. Thuijsman Socially acceptable values for transferable utility games SESSION 4: Game Theory - W.F. Lucas (FC11) A.S. Belenky On 2 and 3 person games on polyhedral sets W.F. Lucas Various fairness outcomes for three-way allocation games K.H. Borgwardt An algorithm for determining the convex hull of random points and its probabilistic analysys GENERALIZED CONVEXITY SESSION 1: Generalized Monotonicity - S. Schaible (MC4) S. Schaible Generalized convexity: a mini tutorial S. Schaible Generalized convexity: a mini tutorial - continued S. Komlosi Generalized monotonicity in nonsmooth analysis SESSION 2: Fractional Programming - A. Ellero (MI4) S. Schaible Generalized Monotonicity: Concepts and uses L. Martein Some optimality conditions in multiobjective programming A. Ellero Sequential algorithms based on the optimal level solutions method SESSION 3: Fractional Programming - F. Jarre (TA4) A. Barros Generalized fractional programming and cutting plane algorithms R.W. Freund An interior point method for multi-fractional programs with convex constraints A. Barros A new algorithm for generalized fractional programs SESSION 4: Generalized Convexity - T. Driessen (TC4) T. Driessen Recent characterizations of generalized convexity in cooperative game theory M. Pappalardo e-optimality for weakly convex problems T. Rapcsak Geodesic convexity on $R^n_+$. SESSION 5: Generalized Convexity - B. Craven (TD4) B. Craven Relations between invex concepts G. Giorgi Various types of nonsmooth invex functions and applications E. Sideri Numerical performances of cutting plane type algorithms for nonconvex constrained problems SESSION 6: Generalized Convexity - P.T. Thach (TF4) V.A. Ubhaya Generalized convex functions and minimum norm problems Blank Spot P.T. Thach Nearly convex structures and applications to optimization problems SESSION 7: Generalized Convexity - J. Martinez-Legaz (WA4) I. Singer Dualities with respect to binary operations on $\bar{R}$ J. Martinez-Legaz Subdifferentials with respect to dualities C. Sutti From monotone maps to generalized convexity SESSION 8 Generalized Convexity - J.-P. Penot (RA4) M. Thera $\psi$-monotonicity S. Tigan Optimality conditions for symmetric generalized convex functions J.-P. Penot Generalized derivatives and generalized convexities SESSION 9: Generalized Convexity - C. Bajona-Xandri (RC4) K. Sekitani General fractional programming: minmax convex-convex quadratic case C. Bajona-Xandri On fractional programming I. Bykadorov Generalized convexity and global optimization GLOBAL OPTIMIZATION SESSION 1: M.P. in Maintenance - S. Duffuaa (MC22) M. Ben-Daya Maintenance scheduling using fuzzy clustering C.M. Klein Power plant maintenance scheduling S. Duffuaa A stochastic programming model for maintenance scheduling SESSION 2: Global Optimization - P. Hansen (MI22) H.D. Sherali Solving nonconvex quadratic and polynomial programs J. Pinter Adaptive partition strategies in continuous and Lipschitz global optimization G. Danninger Optimization for indefinite quadratic programmes SESSION 3: Applications of Global Optimization in Engineering - I.E. Grossmann (TA22) C.A. Floudas A deterministic global optimization for molecular structure determination I.E. Grossmann Global optimization of bilinear engineering design models N. Sahinidis Global optimization of products of convex functions over convex sets SESSION 4: Multiobjective Programming and Efficiency - H.P. Benson - (TC22) M.M. Wiecek Efficiency and augmented duality gap in multiple objective programming M.M. Kostreva Optimality conditions of vector global minimization: an integral approach H.P. Benson Global approaches to representing the efficient set in linear and nonlinear multiple objective optimization SESSION 5: Applications of Global Optimization in Engineering - I.E. Grossmann (TD22) V.M. Nefedov On the complexity of a class of global optimization problem with Lipschitz continuous data S.Z. Selim Determining dominant wind directions C. Rosa Pathways of economic development in an uncertain environment: a finite scenario approach to the U.S. region under carbon emission restrictions SESSION 6: Semidefinite Programming III - H. Wolkowicz (TF22) G. Pataki Cone-LP's and semi-definite programs: Facial structure, basic solutions, and the simplex method M.V. Ramana Some perspectives in semidefinite programming B. Vanderbei The simplest semidefinite programs are trivial SESSION 7: Global Optimization - H. Sherali (WA22) C. Floudas New advances in the GOP algorithm for global optimization Z. Zabinsky Pure adaptive search for global optimization P. Hansen Multivariate Lipschitz optimization: survey and computational comparison SESSION 8: Primal-Dual Methods and Global Optimization - C.A. Floudas (WC22) S.E. Wright Barrier regularization of envelope methods J.M. Mulvey Solving dynamic control systems via deterministic global optimization V. Visweswaran A package for certain classes of global optimization problems SESSION 9: Solution methods for global optimization problems with special structure - P.D. Tao (RA22) S.K. Zavriev On a multistep continuation method for global optimization P.D. Tao D.C. (difference of convex functions) optimization. Duality, optimality, and algorithms. Applications I.M. Bomze Global optimization for concave quadratic problems SESSION 10: Nonconvex Programming: Methods and Applications - Z. Zabinsky (RC22) T.C. Hu Dynamic adaptive search for large scale global optimization Z. Wu Continuation-based gloabl optimization for molecular conformation and protein folding Z. Zabinsky Using global optimization to design composite structures SESSION 11: Global Optimization - J.-B. Hiriart-Urruty (RD22) J.B. Rosen Computing the global minimum by fitting a convex global underestimator to the local minima O.E. Flippo Duality and sensitivity in nonconvex quadratic optimization over a sphere J.-B. Hiriart-Urruty More on the characterization of the global maxima of a (tangentially) convex function over a convex set SESSION 12: Global Optimization - J. Pinter (RF22) J. Mockus A bayesian approach to global discrete optimization Y. Evtushenko Nonuniform space covering technique for global optimization A. Melman Line searches in interior point methods and perturbed eigenvalues SESSION 13: Global Optimization - R. Horst (FA22) J. YiChu Solution and order number methods for multiple objective decision making with incomplete knowledge Blank Spot R. Horst A decomposition approach for the global minimization of biconcave functions over polytopes SESSION 14: Global Optimization - W. Li (FC22) R. Horst A new LP-bound in multivariate Lipschitz optimization and systems of inequalities V. Kaminsky Confidential balls minimizing in mean convex functional W. Li A data smoothing technique for piecewise convex/concave curves SESSION 15: Global Optimization and Quadratic Programming - M.J. Best (FD22) Blank Spot B. Ding Non-convex quadratic programming M.J. Best Non-convex quadratic programming SESSION 16: Global Optimization - V. Jeyakumar (RD21) Blank Spot J. Pinter Global optimization in modeling and managing environmental systems: some applications V. Jeyakumar Complete characterizations of global optimality in nonconvex optimization SESSION 16: Global Optimization - M. Kamat (RF21) Blank Spot J. Fulop On the Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint M. Kamat Design of globally optimum composite laminates for extension-twist coupling SESSION 17: Global Optimization - F.A. Al-Khayyal (FA21) L. Mockus Software for global optimization A.D. Rikun A formula for convex envelopes for bilinear and polylinear functions F.A. Al-Khayyal On finding global solutions of quadratically constrained quadratic programmes SESSION 18: Global Optimization - T. Kuno (FC21) M.L. TenHuisen A quadratic Lagrangian dual approach to nonconvex multiple objective programs D. Haugland Global optimization of quadratically constrained problems T. Kuno A parametric simplex algorithm for a class of low-rank nonconvex optimization SESSION 19: Global Optimization - T. Csendes (FD21) E. Haddad Local and global minima of the separable resource allocation problem with nonconvex functions T. Csendes Recent improvements in interval methods for global optimization A. Bouaricha Tensor methods for large sparse unconstrained optimization SESSION 20: Multi-objective Optimization - F. Lootsma (FF21) M. Polyshuk Invariant binary relations in multi-criteria programming: The approximation approach T. Athan A quasi Monte Carlo method for multicriteria optimization F. Lootsma Controlling the search for a compromise solution in multiobjective optimization HEURISTIC METHODS SESSION 1: Tabu Search - C.C. Ribeiro (MC7) J. Blazewicz Parallel tabu search for two-dimensional irregular cutting A. Lokketangen Tabu search for 0/1 mixed integer programming problems Blank Spot SESSION 2: Student Session: Tutorial on Tabu Search - F. Glover (TA7) F. Glover Tabu search: Improved solution alternatives SESSION 3: Tabu Search - D.L. Woodruff (TC7) C. Reeves Tabu search finds global optima for a class of GA-hard problems R. Battiti The continuous reactive tabu search: global optimization with a hybrid of combinatorial optimization and stochastic local search D.L. Woodruff Proposals for chunking and tabu search SESSION 4: Tabu Search - T.G. Crainic (TF7) E. Pesch Tabu search approaches for facility layout problems E. Captivo Tabu search applied to a capacitated location problem T.G. Crainic Tabu search methods for multicommodity capacitated fixed charge network design problem SESSION 5: Heuristic Methods - D. Tuyttens (WC7) S. Voss Simple assembly line balancing - heuristic approaches A. E. Narro-Ramirez Algorithms for multi-item inventory systems D. Tuyttens Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search SESSION 6: Heuristic methods - P.M. Pardalos (RA7) S. Voss A comparison of tabu search approaches for solving quadratic assignment problems R. Burkard Biquadratic Assignment Problems L. Gibbons A continuous based heuristic for the maximum clique problem SESSION 7: Heuristic Methods - M. Gendreau (RC7) X.-C. He Heuristic method on solving traffic network under variable parameter condition V. Deineko Solvable cases of the traveling salesman problem and heuristics M. Gendreau New heuristics for the traveling salesman and vehicle routing problems with time windows SESSION 8: Heuristic Methods - D. Brown (RF7) W.R. Stewart Guidelines for reporting heuristic results P. Mirchandani Heuristics, LPs, and trees on trees D. Brown The communication spanning tree problem: comparison of an heuristic, random search methods, and lower bounding SESSION 9: Heuristic Methods - S. Gass (FA7) R. Seguin A tabu search heuristic for the vehicle routing problem with stochastic customers and demands D.C. Meyers A simulated annealing algorithm for scheduling military training A. Joseph Computational results of an objective hyperplane search heuristic for a class of the general ILP SESSION 10: Genetic Algorithms - Z. Michalewicz (FC7) H. Muehlenbein The breeder genetic algorithm and its application to optimization problems S. Nagendra Improved genetic algorithms for the design of composite panels Z. Michalewicz Evolutionary computation for mathematical programming INTEGER PROGRAMMING SESSION 1: Integer Programming - M. Posner (MC13) C. Potts Scheduling with finite capacity output buffers N. Hall Parallel machine scheduling with a common server M. Posner Single crane scheduling SESSION 2: Cutting Planes - G. Mitra (MI13) F. Abdul-Hamid Polyhedral cutting plane method: design, implementation and experience S. Rangel Preprocessing and cutting planes for a class of production planning problems M. Mahar Shortest route relaxation for the solution of set covering and partitioning problems SESSION 3: Computational Integer Programming- M.W.P. Savelsburgh (TA13) P. Mutzel Approximate and exact algorithms for the maximum planar subgraph problem C. Hane Using column generation and Rosen's partitioning method to solve multi-commodity network flow problems L. W. Clarke Network design with column generation SESSION 4: Computational Integer Programming - M.W.P. Savelsburgh (TC13) P. Bauer On the symmetric circuit polytope E. A. Boyd A fully polynomial approximation cutting plane algorithm for integer programs represented by a separation oracle and related results M.W.P. Savelsburgh Cover inequalities for 0/1 linear programs SESSION 5: Integer Programming - J. Hooker (TD13) R.R. Thomas Variation of cost functions in integer programming J. Hooker A logic based method for integer programming S.T. McCormick Polynomial methods for separable convex optimization in unimodular spaces SESSION 6 Integer Programming - D. Bienstock (TF13) C. Blair A closed form solution for mixed integer program value functions N. van Thoai A decomposition method in mixed-integer nonconvex programming D. Bienstock Quadratic programming with mixed-integer constraints SESSION 7: Integer Programming - S. Leyffer (WA13) X. Wu Extending the integer search method from linear case to nonlinear case A. Nou A differentiable dual approach to large scale 0/1 problems S. Leyffer On the solution of nonconvex MINLP SESSION 8: Integer Programming - Y. Wang (WC13) E.K. Lee Parallelism in mixed integer programming J. Eckstein Parallel versus distributed storage and control in parallel mixed integer programming branch and bound Y. Wang Characterizations of primal and dual nondegeneracies for a general polyhedron INTERIOR POINT METHODS SESSION 1: Probabilistic Analysis of Interior Point Algorithms - K. Anstreicher (MC1) M. Todd Global and local probabilistic models for analyzing interior-point methods K. Anstreicher Average case analysis of interior-point algorithms I. Adler Issues in probabilistic analysis of LP algorithms SESSION 2: Interior Point and Bundle Column Generation Algorithms - J.-L. Goffin (MI1) A.L. Hipolito Combining central-cutting plane and bundle strategies for convex nondifferentiable optimization: a weighted least squares approach J.-L. Goffin Solving nonlinear multicommodity flow problems with the analytic center cutting plane method U. Brannlund A descent proximal level bundle method for convex nondifferentiable optimization SESSION 3: Potential Function and Reduction in LP and semi - LP - M. Todd - (TA1) K. Anstreicher Large step volumetric potential reduction algorithms for linear programming Y. Nesterov Long-step strategies in interior point potential reduction methods M. Todd Self-scaled cones and interior-point methods in nonlinear programming SESSION 4: Infeasible-Interior-Point Algorithms I - S. Mizuno (TC1) S. Shindoh Decomposition in interior point methods Y. Ye Further development on homogeneous and self-dual linear programming algorithms J. Ji An $O\left((\k+1)^2{n}L\right)$ infeasible-interior-point algorithm for the $P_*$ matrix LCP SESSION 5: Infeasible-Interior-Point Algorithms - S. Mizuno (TD1) M. Muramatsu On the behaviour of the affine scaling algorithm starting from an infeasible point F.A. Potra Polynomial complexity and superlinear convergence of infeasible-interior-point algorithms S. Mizuno An infeasible interior point algorithm using projections onto a convex set SESSION 6: Termination and Local Behaviour of Interior Point Algorithms - R. Tapia (TF1) A. El-Bakry On the use of indicator functions for identifying binding constraints in constrained optimization problems M. Gonzalez - Lima On effectively computing the analytic center by primal-dual interior point methods Y. Zhang A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence SESSION 7: Convergence of Affine Scaling Algorithms - T. Tsuchiya (WA1) I.I. Dikin Convergence of a sequence of dual variables at the solution of a completely degenerate problem of linear programming C. Roos Convergence properties of a primal affine scaling method for the homogeneous linear programming problem R. Saigal Efficient variants of the affine scaling method SESSION 8: Interior Point Algorithms for Network and Combinatorial Optimization - M.G.C. Resende (WC1) J. Mitchell Using an interior point algorithm in a cutting plane method for solving integer programming problems G. Veiga An efficient implementation of a network interior point method L. Portugal An implementation of the primal-dual interior point algorithm for the solution of the minimum cost network flow problem SESSION 9: Interior Point Methods for Nonpolyhedral optimization - Y. Nesterov (RA1) F. Jarre An interior point method for fractional programming with convex constraints B. Jansen Primal-dual affine scaling algorithms for nonlinear monotone complementarity problems D.F. Shanno Using interior point methods to compute economic equilibria SESSION 10: Barrier Functions and Path-Following - M.H. Wright (RC1) C. Gonzaga Fast convergence of the simplified largest step path following method A. Nemirovskii Multi-parameter long-step interior methods for convex problems C. Roos A unifying approach to interior point methods for linear programming: the target following approach SESSION 11: Implementation of Interior Point Methods for Linear and Nonlinear Programming- H. Yamashita (RD1) J. Gondzio Presolve analysis of linear programs prior to applying the interior point method M. Breitfeld A globally convergent penalty-barrier for nonlinear programming H. Yamashita Theory and implementation of an interior point trust region method for large scale nonlinear optimization SESSION 12: Computational Issues in Interior Point Methods - R. Vanderbei (RF1) J. Czyzyk Solving multi-stage stochastic linear programs using interior point techniques in parallel R. Vanderbei An algorithmic and numerical comparison of several interior point methods R. Saigal Infinitely summable series implementation of interior point methods SESSION 13: Computational Methods for Complementarity Problems - P. Tseng (FA1) F. Potra Infeasible interior point algorithms for LCP R. Monteiro An infeasible primal-dual affine scaling algorithm for LCP P. Tseng Penalty based infeasible interior point methods for monotone CP SESSION 14: Convergence of Interior Point Methods - R. Saigal (FC1) G. Zhao High-order large-step path-following algorithms for linear programming J. Sun Computational schemes for large-scale extended linear-quadratic programming based on interior point methods T. Tsuchiya A new family of polynomial time interior point algorithms for linear programming SESSION 15: Alternate Approaches to Linear Programming - Y. Ye (FD1) D. Atkinson Bounding the number of iterations in path following iterations E. D. Andersen Combining interior-point and pivoting algorithms for linear programming Y. Ye An asymptotical O(sqrt(n) L)-iteration path following linear programming algorithm that uses long steps SESSION 16: Computational Complexity of Interior Point Methods - J. Renegar (FF1) J. Vera On the complexity of linear programming under finite precision arithmetic P. Beling Strongly polynomial algorithms for certain patterned linear programs A. Barvinok Linear programming, quadratic convexity, and distance geometry SESSION 17: Primal-Dual Methods for Nonlinear Programming - M.H. Wright (MC2) A. Forsgren On the conditioning of interior methods for numerical optimization R. Byrd An interior point method for general nonlinear programming using trust regions M.H. Wright A primal-dual method for nonlinearly constrained optimization SESSION 18: Interior Point Methods - J.L. Nazareth (MI2) I. Litvinchev Polynomial complexity of the affine-scaling algorithm C. Luz Superlinear variant of the dual affine scaling method J.L. Nazareth A framework for interior methods for linear programming SESSION 19: Semidefinite Programming I- M. Overton (TA2) M. Overton A new primal-dual interior-point method for semidefinite programming L. Vandenberghe Solving structured positive definite programs using interior point methods H. Wolkowicz A recipe for the best semidefinite relaxation for (0,1) - quadratic programming SESSION 20: Interior Point Methods - R. Cominetti (TC2) R.A. Tapia On the formulation of the Karmarkar and primal-dual interior point algorithms for linear programming M.G.C. Resende Computing lower bounds for the quadratic assignment problem with an interior point method for linear programming R. Cominetti Asymptotic behaviour of trajectories associated with the exponential penalty in linear programming SESSION 21: Semidefinite Programming II - M. Overton (TD2) R. Freund Complexity issues in solving ill-behaved semidefinite programs J.-P. Haeberly A local primal-dual interior point method for optimizing the eigenvalues of hermition definite pencils C. Helmberg An interior point method for semidefinite programming SESSION 22: Interior Point Methods - J. Guddat (TF2) T. Chandrupatla Method of expanding hyperspheres: An interior algorithm for linear programming K. Kim A primal null-space affine scaling method J. Guddat Path following methods in nonlinear optimization: Penalty and multiplier embeddings SESSION 23: Some New Developments in Interior Point Methods - O. Guler (WA2) D. Bertsimas On the worst case complexity of potential reduction algorithms for linear programming M. Todd Lower bounds on the number of iteration of primal-dual interior-point algorithms for linear programming O. Guler Barrier functions in interior point methods SESSION 24: Interior Point Methods - S. Zhang (WC2) J.N. Singh A variant of primal-dual infeasible-interior-point algorithm for linear programming J. Sturm Large step primal-dual cone affine scaling C. Singh A class of generalized convex functions SESSION 25: Interior Point Methods - R.W.H. Sargent (RA2) G. Roth A truncated log barrier algorithm for large scale convex programming and minmax problems: implementation and computational results A. Sofer Giving barrier methods a tune-up R.W.H. Sargent Infeasible-interior-point methods for generalized monotone linear complementarity problems SESSION 26: Interior Point Methods - P. Oliveira (RC2) P. Chin Iterative algorithms for the normal and augmented equations B. Jansen A polynomial primal-dual Dikin-type algorithm for linear programming P. Oliveira Using Riemannian geometry to obtain new results on Dikin and Karmarkar methods SESSION 27: Condition based complexity for linear programming: A mini-Symposium - S.A. Vavasis (RD2) J. Renegar Linear programming, complexity theory, and elementary functional analysis I. Adler Primal-dual interior point methods for quadratic, semidefinite, and p-cones S.A. Vavasis An accelerated interior point method whose running time depends only on A. SESSION 28: Interior Point Methods - P. R. Oliveira (RF2) R.H. Tutuncu Computational experience with some interior point LP codes X. Xu On the implementation of a homogeneous and self-dual linear programming algorithm P. R. Oliveira A new polynomial algorithm for linear problems SESSION 29: Interior Point Methods - S.A. Vavasis (FA2) J. Renegar Viewing interior point methods as efficient and stable preconditioners S.A. Vavasis Stable solution of KKT linear systems arising in interior point methods Blank Spot SESSION 30: Interior Point Methods - Y. Evtushenko (FC2) X. Xu An $O(\sqrt{n} L}$-iteration large step path following infeasible interior point algorithm for linear programming T. Steihaug A truncated interior point method Y. Evtushenko Interior point technique for LP and NLP SESSION 31: Stochastic Linear Programming and Interior Point Methods - R. Saigal (FD2) R. Saigal Stochastic linear programming, affine scaling, and Kalman filter S. Guan Linear programming with stochastic elements: an on-line approach S. Nielsen Parallel solution of robust optimization problems using interior point methods ISOTONIC REGRESSION AND RELATED PROBLEMS SESSION 1: Isotonic Regression and Related Problems -V.A. Ubhaya (RC21) M. Brooks Algorithms and applications of scale dependent monotonicity N. Chakravarti Minimizing separable convex functions subject to simple chain constraints V.A. Ubhaya Polynomial algorithms for integer isotonic and quasi-convex regression problems LARGE SCALE MODELS SESSION 1: Structured LP's - J.K. Ho (MC17) K. Gnanendran Linear programs for multistage production scheduling: some computational aspects R.P. Sundarraj Distributed nested decomposition of staircase linear programs D. Fuller LP and NLP decomposition without a master program SESSION 2: Subroutine Libraries and Modeling - J. Forrest (MI17) B. Nygreen Some wishes for the integer part of the new subroutine libraries for mathematical programming J. Forrest Scaleable parallel processing with the optimization subroutine library S. Savage Lotus Improv as a mathematical modeling language SESSION 3: Large-Scale Constrained Optimization - M.A. Saunders (TA17) P.E. Gill Transformed Hessian methods for large scale constrained optimization V.E. Krivonozhko A development of solution methods for large-scale optimization D. Jones Efficient solution and analysis of large-scale goal programmes SESSION 4: Large-Scale Constrained Optimization - M.A. Saunders (TC17) M.A. Saunders Recent developments to MINOS A.S. Drud The GRG approach for large-scale optimization A. Sartenaer A class of iterated-subspace minimization methods for nonlinear optimization SESSION 5: Algorithmic Developments for Large Scale Mathematical Programming I - G. Mitra (TD17) R. Vanderbei An interior point method for large scale convex programming I. Maros Strategies for creating advanced basis for large scale linear programming K. Frauendorfer Bounding common resources in large scale programming. SESSION 6: Algorithmic Developments for Large Scale Mathematical Programming II - G. Mitra (TF17) D. Goldfarb Augmented Lagrangian / modified barrier methods for nonlinear programming M. Breitfeld Modified barrier methods for large scale nonlinear programming B. Hattersley Extensions to the definition of MIP problems SESSION 7: Large Scale Optimization - R. W. Freund (WA17) D. Conforti A parallel gradient distribution algorithm for large scale optimization R.W. Freund Iterative solution of indefinite systems arising in large scale optimization by the symmetric QMR algorithm D.P.Bertsekas Partial sorting algorithms for shortest path problems SESSION 8: Large Scale Optimization - K. Madsen (WC17) S. G. Nash Preconditioners for large scale optimization J. Liu An interior Newton method for large-scale quadratic programming K. Madsen Continuation methods for linear and quadratic programming SESSION 9: Exploiting Parallel Computers for Large Scale Mathematical Programming - J.A. Tomlin (RA17) R. Marsten Interior point methods on the INTEL paragon J. Hall Pricing strategies for the parallel revised simplex method J.A. Tomlin Load balancing of a scaleable parallel implementation of stochastic programming with importance sampling SESSION 10: Exploiting Parallel Computers for Large Scale Mathematical Programming - M. Hajian (RC17) G. Mitra Experiences with interior point method across a range of parallel computing architectures R. Ashford Solving MIPs with parallel processing M. Hajian A distributed processing algorithm for solving MIPs using a cluster of workstations LCP SESSION 1: Linear Complementarity - J.J. Judice (WA8) A. Iusem A new interior point method for the variational inequality problem R. Sznajder The horizontal linear complementarity problem J.J. Judice An investigation of algorithms for large scale monotone linear complementarity problems SESSION 2: Linear Complementarity - R. Cottle (WC8) D. Baraff Dynamic simulation of nonpenetrating bodies J. Trinkle Complementarity formulations of rigid body motion problems S. Mizuno A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementarity condition SESSION 3: Linear Complementarity - R. Stone (RA8) T. Parthasarathy Zero-sum two-person games in LCP T. Terlaky A family of polynomial affine scaling algorithms for positive semidefinite linear complementarity problems G. Isac The fold complementarity problem: A topological index on cones and the Hyers-Ulam stability SESSION 4: Linear Complementarity - R. Stone (RC8) S.J. Wright An infeasible interior point algorithm for mixed monotone LCP S.R. Mohan On the vertical block generalized linear complementarity problem S.C. Billups A shifted-barrier method for box-constrained linear complementarity problems SESSION 5: Linear Complementarity - G.S.R. Murthy (RD8) T. Parthasarathy A Lipschitzian characterization of negative N-matrices W. Morris Lemke paths and P-matrices G.S.R. Murthy Some properties of fully-semimonotone Q_0 matrices SESSION 6: Linear Complementarity - R. Cottle (RF8) G. Ravindran On copositive semi-monotone Q-matrices U.M. Garcia-Palomares Solving convex (and linear) complementarity problems by projection methods (undamped Newton) P.W. Smith Using Dykstra's cyclic projections algorithm SESSION 7: Linear Complementarity - W. Oettli - (FA8) S. Xu Some characterizations for sufficient matrices W. Oettli Continuity of the solution set of homogeneous equilibrium problems and linear complementarity problems Y. Zhang On polynomiality of the Mehrotra-type predictor-corrector interior point algorithms LINEAR PROGRAMMING SESSION 1: Linear Programming - B. Kristjansson (RA13) M. Makowski Data interchange tool for linear programming S. Mardle Investigation of pre-analysis techniques and basis recovery for linear programmes B. Kristjansson The impact on new developments in graphical user interfaces on modeling in mathematical programming SESSION 2: Linear Programming - C.G. Broyden (RC13) C.G. Broyden An LP Algorithm R. Fletcher Steepest edge, degeneracy, and conditioning in LP M. Kon-Popovska On the solution of the linear programming problem with parametric elements of the matrix coefficients SESSION 3: Linear Programming - M. Vlach (RD13) M. Pullan Existence and duality theory for separated continuous linear programs M. Sodhi An asynchronous parallel algorithm for linear programming based on the simplex method M. Vlach Improved error bounds for aggregated linear programmes SESSION 4: Linear Programming - H.I. Gassmann (RF13) M. Parker Finding a minimum weight IIS cover Blank Spot H.I. Gassmann Solving linear programs with multiple right hand sides SESSION 5: Linear Programming - M. Kallio (FA13) T. Terlaky A survey on pivot rules for linear programming C. Lassez Programming with constraints M. Kallio Parallel solution of linear programs via Nash equilibria SESSION 6: Linear Programming - S. Filipowski (FC13) P.-Q. Pan A generalization of the bisection simplex method J.M. Jacobs A bound for LP problems based on projective transformations S. Filipowski On the complexity of solving linear programs specified with approximate data SESSION 7: Linear Programming - A. Amhemad (FD13) W.H. Yang Solving linear programs by calculus H. Xuli The iterative computing method on nonbase vectors for linear programming A. Amhemad Reduction techniques and model analysis for linear models LINEAR - INFINITE PROGRAMMING SESSION 1: Linear and Quadratic Semi-infinite programming I - Fang (WC20) S.-Y. Wu On linear semi-infinite programming problems, an algorithm H.-C. Lai Convergence of semi-infinite measure programs in infinite programming M.E. Kraus Generalized path following for linear semi-infinite programming SESSION 2: Consistent Approximations and Semi-infinite programming - S.Y. Wu (RA20) E. Polak On the use of consistent approximations in the solution of semi-infinite optimization, optimal control, and shape-optimization problems. E. Polak On the use of consistent approximations for the optimal design of beams S.-Y. Wu An inexact approach to solving linear and quadratic semi-infinite programming problems LOCATION METHODS SESSION 1: Location Methods - R. Aceves-Garcia (RF15 ) C. DeSimone A strong formulation for the plant location problem G. Wanka Vectorial location problems - duality and efficiency R. Aceves-Garcia The separable Lagrangean relaxation in the cross decomposition method for the facility location SESSION 2: Location Methods - H.W. Hamacher (FA15 ) S. Zhang General models in min-max planar location M.C. Fonseca An interactive method for the location of semiobnoxious facilities H.W. Hamacher Pareto and max ordering location problems SESSION 3: Location Methods - T.J. Lowe (FC15 ) C. Chen A two-level facility location problem for the location of distributed centers I. Averbakh Parallel NC-algorithms for multifacility location problems on a tree and their applications T.J. Lowe On the location of a tree-shaped facility SESSION 4: Polyhedral Results in Facility Location - C.P.M. van Hoesel (FD15 ) K. Aardal Polyhedral results for the uncapacitated facility location problem: Lifting and separation C.P.M. van Hoesel Polyhedral results for the uncapacitated facility location problem: Effectiveness of inequalities and new facets R.E. Rosenthal "Integerizing" real-world integer programs LOGIC AND MATHEMATICAL PROGRAMMING SESSION 1: Logic and Mathematical Programming - Y. Blum (WA19) S.K. Snyder Existence of comparative statics for general equilibrium models B.C. Eaves Complete solvability of linear problems and randomized linear algorithms A. Hefner A polyhedral approach to a constrained assignment problem SESSION 2: Logic and Mathematical Programming - B.C. Eaves (WC19) P. Van Hentenryck Constraint logic programming for combinatorial search problems: an overview M. Wallace Separating logic and control in constraint programming B.C. Eaves Degeneracy resolutions and parametric solutions using ordered fields MATCHING ALGORITHMS SESSION 1: Matching Algorithms - T. Bergstrom (TD20) J. Vande Vate Stable matchings, optimal assignmnts and linear programming T. Quint Restricted houseswapping games T. Bergstrom Age at marriage in marriage markets with overlapping generations SESSION 2: Matching Algorithms - T. Bergstrom (TF20) Y. Blum Vacancy chains and equilibration in senior-level labor markets E.A. Medova A matrix reduction algorithm for optimal matching G. Rattier On the stable marriage polytope MATROIDS SESSION 1: Matroids and Combinatorial Programming - F. Maffioli (MC5) A. Barvinok New algorithms for linear k-matroid intersection and matroid k-parity problems A. Frank Applications of polymatroids to connectivity augmentation J. Vandevate 2-Lattice polyhedra SESSION 2: Matroids - C. Coullard (MI5) C. Coullard Learning binary matroid ports G. Ding On infinite antichains of matroids J. Geelan Delta-matroids SESSION 3: Matroids 2 - A. Sebo (TA5) M. Loebl On partition log-supermodular matroids D. Babayev Solving integer knapsack problems by integer equivalent aggregation and consistency testing L.G. Khachiyan Testing the duality of monotone DNFs in $N^{o(log N)}$ time SESSION 4: Matroids and Knapsack Problems - P. Barcia (TC5) P. Barcia When is a 0-1 knapsack a matroid? L. Amado Tight polynomial bounds for matroidal knapsacks K. Park Lifting procedures for the precedence-constrained knapsack problem MATHEMATICAL ECONOMICS SESSION 1: Mathematical Economics - Y.-A. Fan (MC20) B.C. Eaves An algorithm for the general equilibrium model with incomplete asset markets A. Loerch Incorporation of learning curve costs in acquisition strategy optimization Y.-A. Fan Nested versus non-nested decomposition for asset allocation problems SESSION 2: Economics and Mathematical Programming - B.C. Eaves (MI20) R. Gomory A Ricardo model with economies of scale (14:45 - 15:30) H. Scarf The simplicial complex of maximal lattice free bodies (15:30 - 16:15) SESSION 3: Mathematical Economics - M. Nunez (TA20) M. Manas Blocking effect in oligopoly N. Trenev Some problems of constructing mathematics models to economic forecast in Russia M. Nunez Extreme core points and reduced games SESSION 4: Mathematical Economics - J.-J. Herings (TC20) A. Van Den Elzen A price/quantity adjustment process in a general equilibrium model with constant returns to scale technologies J.-J. Herings A globally and universally stable price adjustment process T. Nagy An application of the entropy programming for transportation problems SESSION 5: Computation of Economic Equilibria - A.J.J. Talman (FC20) F. S. Evangelista Structural relation of the set of Nash and correlated equilibria A.J.J. Talman A simplicial algorithm for computing proper Nash equilibria of finite games C. Tapia Local versus global efficiency evaluation using data envelopment SESSION 6: Resource Allocation - E. Haddad (FF13) E. Haddad Minimax resource allocation: Necessary and sufficient condition for optimality A. Dharmakadar A procedure for solving the minimax resource allocation problem with multimodal functions E. Haddad Minimax resource allocation with uniminimum activity functions MATHEMATICAL PROGRAMMING SESSION 1: M.P. Languages - S. Moody (TF9) W.G. Golush Recent extensions of the Omni language to allow nonlinear equation and an interface to a nonlinear solver S. Moody Incorporating procedural knowledge within a declarative LP modeling language I. Chabini An entropy based primal dual algorithm for convex and linear cost transportation problems with serial and parallel implementations SESSION 2: M.P. Languages - C. Spera (RD17) C. Spera The features of blooms M. Gagliardi Recent results in model integration R. Fourer Integrating programming features with an algebraic modeling language for optimization SESSION 3: Algorithms - E. Anderson (RD14) H.A. Eiselt On the bounce method for mathematical programming M.M. Mansouri A new global optimized decision algorithm E. Anderson A direct search algorithm for optimization with noisy function evaluations SESSION 4: Duality - R. Correa (RF14) W. Kaplan Some duality theorems in mathematical programming C.R. Bector Duality for a generalized minmax programming problem involving (B,n)-invex functions R. Correa Reducing the duality gap in partially convex programming SESSION 5: Maps and Inverse Problems - P. Kas (FA14) S. Flam Successive averages of firmly nonexpansive mappings Z. Lei Generalized strongly monotone maps P. Kas On the dual of linear inverse problems SESSION 6: Optimality Conditions - N. Trenev (FC14) A.V. Dmitruk Third order necessary and sufficient conditions for a local minimum in the general problem of mathematical programming K. Kortanek Solving primal and dual geometric programming problems simultaneously N. Trenev Some decomposition principles to coordinate local algorithm in distributed decision support systems SESSION 7: Mathematical Programming - D.M. Gay (FD14) S. Simons A metaminimax theorem H. Attouch Viscosity solutions of minimization problems D.M. Gay Automatic differentiation and detection of partially separable structure SESSION 8: Mathematical Programming Models and Methods - A. Bachem (FF14) M. Brooks Scale dependent monotonicity and scale dependent extrema T.-S. Chang Formulating distributed, simultaneous engineering with robust technologies A. Bachem Computational experience with simulated trading algorithms solving vehicle routing and other combinatorial optimization problems SESSION 9: Algorithms and Application - L. Watson (WA20) D.S. Bernstein Computational challenges in robust, fixed structure control H. Walker A GMRES-Backtracking newton iterative method L. Watson A variable-complexity approach to multidisciplinary optimization SESSION 10: Homotopy Methods and Optimality Conditions - W. Forster (FD20) W. Forster Homotopy methods, systems of polynomial equations, and the Kuhn-Tucker conditions Z. Wang Notes on computation of Kakutani fixed points A.V. Dmitruk Quadratic order necessary and sufficient conditions for a Pontryagin minimum for singular extremals touching the boundary of admissible control set M.P. IN AIRLINES MANAGEMENT SESSION 1: M.P. in Transportation - K. Hoffman (FD6) J.L. de Jong Nonlinear optimization in soaring N. Boland A formulation for aircraft rotation K. Chelst Routing and scheduling for banks SESSION 2: M.P. in Airlines Management - K. Hoffman (FF6) R. Marsten Crew planning at Delta airlines C. Barnhart A duty-period-based formulation of the airline crew scheduling problem R. Rushmeyer US Air's fleet assignment model M.P. IN MANUFACTURING SESSION 1: M.P. in Manufacturing - E. Zak(FD7) A. Andijani Optimization of pocket milling operation of rectangular shapes E. Zak Cutting and skiving stock problems V.R. Prasad Software for two dimensional cutting stock problem SESSION 2: M.P. in Manufacturing - R. Rachamadugu (FF7) B.V. Pleskach Dynamics of heavy machines and their optimum design W.W. Finch A set-based approach to the automated selection of components R. Rachamadugu Kohonen neural network approach to cell formation in group technology M.P. IN MEDICINE SESSION 1: M.P. in Medicine - Y. Censor (FF15) G. Ezzell Optimization of radiation therapy treatment planning T. Beergrehn Multiobjective optimal design of magnetic resonance imaging gradient waveforms Y. Censor Multiprojection algorithms with generalized projections M.P. IN THE MILITARY SESSION 1: M.P. in the Military - P. Djang (FF5) S.M. Robinson Estimating marginal system effectiveness P. Djang Mobile close combat tactical trainer location and routing model R. Laferriere Scenario analysis for combat systems M.P. IN ENERGY INDUSTRIES SESSION 1: Energy Planning - S. Takriti (RC19) F. Prieto Network planning under uncertainty with an application to hydropower generation S.M. Wallace Decentralized production planning for hydro-based electricity generation S. Takriti A stochastic model for the unit commitment problem SESSION 2: M.P. in Hydro-Electricity - S. Dye (RD19) G.L. Schultz Asynchronous price-directed decomposition for hydro and thermal electric systems A. Philpott A mathematical programming model for daily hydro-electricity generation S. Dye Hydro-thermal power scheduling in New Zealand SESSION 3: M.P. in Oil Industry - M. Gockenbach (RF19) E. H. Zadeh Optimal transportation of oil products in Iran S. Gomez Optimization of an inverse seismic problem M. Gockenbach Seismic velocity inversion by differential semblance optimization SESSION 4: M.P. in Power Industries - P.O. Lindberg (FA19) F.H. Fahmy A new algorithm to study the cell performance of various sets of PV modules J.M. Jacobs Spreadsheet-based optimization for natural gas contract portfolio planning P.O. Lindberg Solving detailed structured duals of unit commitment problems SESSION 5: M.P. in Power Industries - S. Danov (FC19) F.H. Fahmy Scheduling and resource allocation of non-conventional power systems via multi-level approach M. Tamiz An exploration of linear and goal programming models in the downstream oil industry S. Danov Method of quasi-control for optimization of energy conversion systems M.P. IN STATISTICS SESSION 1: MP in Statistics - M.A. Duran (RD5) T. Wang An interior point potential reduction method for constrained equations J. A. M. Gallego Local search with gradient neighborhoods: application to optimization problems in statistics M.A. Duran Global d-optimal experimental design for linear finite-space models SESSION 2: M.P. in Statistics - R. Khattree (RF5) N. Chakravarti Sensitivity analysis in isotonic median regression A. Bagchi Optimization of dispersion functions to obtain rank estimates I.E. Schochetmen Infinite isotonic regression SESSION 3: Probability Distributions - J. Lee (FA5) K. Marti Differentiation of probability functions J. Lee Eigenvalue bounds for statistical design problems blank spot SESSION 4: Design of Experiments - S.B. Crary (FC5) C. Nachtsheim Computational aspects of optimal experimental design: the state of the art V.V. Fedorov Constrained optimization and the design of experiements S.B. Crary Characterization of objective function spaces in optimal design of experiments M.P. IN TELECOMMUNICATIONS SESSION 1: M.P. in Telecommunications - D.X. Shaw (TC19) D.X. Shaw Reformation and column generation for several telecommunication network design problems S. Park A branch-and-cut algorithm for the bandwidth packing problem K. Lee A branch-and-cut algorithm for the generalized communication tree network design SESSION 2: M.P. in Telecommunications - C. Wynants (TD19) R. Rardin Simultaneous backbone and local access network design C. Wynants Optimizing reserve capacities of a telecommunication network in presence of cross-connects D. Hartvigsen Generalized network flows and augmenting paths SESSION 3: M.P. in Telecommunications - G. Hu (RA19) A. van den Nouweland A game theoretic approach to problems in telecommunication V. Venkateswaran Deployment algorithm for new service site selection G. Hu Forest build tree algorithms for multiple destination routing problem in communication networks NETWORK ALGORITHMS SESSION 1: Network Algorithms - B.E. Hoppe (RA18) B. Klinz Minimum cost dynamic flow problems D.P.Bertsekas An auction algorithm for the max-flow problem B.E. Hoppe A polynomial time algorithm for the evacuation problem SESSION 2: Network Algorithms - G. Isac (RC18) N. Curet A steepest edge primal dual network simplex algorithm L. Liu On nested selections which are not monotone and some parametric max flow problems G. Isac S-pseudomonotone and E-pseudomonotone operators SESSION 3: Network Algorithms - F. Lootsma (RD18) F. Lootsma Stochastic and fuzzy network planning D. Monhor On random completion time in stochastic PERT F. Vanderbeck An algorithm for IP column generation SESSION 4: Network Algorithms - V. Glamocanin (RF18) I. Chabini An entropy based primal dual algorithm for multicommodity convex and linear cost transportation problems with serial and parallel implementations D. Fernandez-Baca Faster parametric search on decomposible networks V. Glamocanin Direct solution of uncapacitated transshipment problem SESSION 5: Network Algorithms - T. Ibaraki (FA18) B.W. Lamar Nonconvex network optimization: Algorithms and software S. Ghannadan The minimum concave cost network flow problem with a fixed number of sources and nonlinear arc costs T. Ibaraki Two arc disjoint paths in Eulerian digraphs SESSION 6: MP Modeling Software - L. Lasdon (FC18) K. Kusakari Mathematical programming software, modeling and performance W.T. Ziemba Growth capitol and proportional investment strategies L. Lasdon Optimization using the Microsoft EXCEL solver and Microsoft Windows SESSION 7: Network Algorithms - G.N. Frederickson (FF18) B. Gendron Toward efficient resolution of large-scale multicommodity capacitated fixed charge network design problem Blank Spot G.N. Frederickson Data structures for dynamically maintaining rooted trees, with applications to network flow NETWORK DESIGN AND SYNTHESIS SESSION 1: Submodularity I - S. Fujishige (MC12) A. Dress New aspects of greedy algorithms P. Sharma Bisubmodular polyhedra: Facets, adjacency, and a greedy algorithm S. Fujishige On bisubmodular functions SESSION 2: Submodularity II - U.N. Peled (MI12) H. Narayanan Polymatroids and electrical networks S.T. McCormick Why doesn't min mean canceling work for submodular flow U.N. Peled Poset matching - A distributive analog of independent matching SESSION 3: Submodularity III - S. Chopra (TA12) A. Buchet Covering of multimatroids by independent sets A. Tamir Least elements and generalized polymatroids S. Chopra Extended Formulations for multiways cuts in graphs SESSION 4: Network Synthesis I - R.E. Best (TC12) Blank D. Bienstock Capacity expansion in telecommunications: Computation in various models R.E. Best Design of fault tolerant networks SESSION 5: Multicommodity Flows I - A.V. Karzanov (TD12) M.V. Lomonosov A min-max theorem for integer multiflows H. Ilani Multiflows and matchings A.V. Karzanov Multiflow and disjoint paths of minimum total cost SESSION 6: Combinatorial Optimization I - S.N. Kabadi (TF12) B. Yu Hypercubes and multicommodity flows R. Chandrasekaran Tessellation of Hilbert Bases S.N. Kabadi Polynomial implementations of Newton's method for a class of combinatorial optimization problems SESSION 7: Combinatorial Optimization II: - E. Barahona (WA12) M. Penn Characterizations of naturally submodular graphs: A polynomially solvable class of TSP A. Dress New algorithms for restructuring phylogenetic trees E. Barahona Packing spanning trees SESSION 8: Network Design and Synthesis - S. Plotkin (WC12) K. Holmberg Solving the discrete network design problem to optimality A. Figlali A multiobjective two layer transportation network design model S. Plotkin New network decomposition theorems with applications SESSION 9: Network Design and Synthesis - A. Sebo (RA12) M. Nakamori Bilinear programming problems of making a directed graph acyclic T. Uno Linear time algorithm for finding a k-tree-core of a tree A. Sebo On the hierarchy of conditions for multiflow feasibility SESSION 10: TSP, Polyhedral Structure, and Set Approximation - R.J. Caron (RC12) G. Cesari Quality analysis of the solution produced by dissection algorithms applied to the traveling salesman problem R. Rudolph Recognition of some special cases of the TSP R. Huotari Approximation of, and by, sets SESSION 11: Solving travelling salesman problems - V. Chvatal (FF19) D. Applegate Solving travelling salesman problems V. Chvatal Solving travelling salesman problems NEURAL NETWORKS SESSION 1: Neural Networks II - J. Shavlik (MI7) M. Jordan Hierarchical mixtures of experts and the EM algorithm J. Shavlik Using sampling and queries to extract rules from trained neural networks T. Takada A neural network system for solving an assortment problem in the steel industry SESSION 2: Neural Networks I - O. Mangasarian (TD7) I. Adler Convex quadratic optimization on artificial neural networks O. Mangasarian Misclassification minimization via mathematical programming J.E. Aronson A parallel forward network simplex algorithm and implementation SESSION 3: Neural Networks III - K.P. Bennet (WA7) Z.-Q. Luo Approximate gradient projection method and backpropagation algorithms B. Golden A neural network approach to the orienteering problem K. Bennett Neural learning via multilinear programming SESSION 4: Neural Networks IV - R. Setiono (RD7) A. Gaivoronski Stochastic gradient method for training of a class of recurrent neural nets R. Setiono A penalty function approach for pruning feedforward neural network R.R. Meyer Parallel genetic algorithms for large-scale fixed charge networks NLP SESSION 1: Nonlinear Programming - T. Coleman (MC9) Q. Zhao Measures for large sparse secant updates Z. Parada On the characterization of Q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming T. Coleman On using conjugate gradients for nonlinear minimization subject to linear constraints. SESSION 2: Trust Regions - T. Coleman (MI9) M. El-Alem A robust trust-region algorithm with a non-monotonic penalty parameter scheme for constrained optimization A. Liao An efficient trust region method for unconstrained discrete-time optimal control problems S. Kim Descent method for nondifferentiable convex optimization SESSION 3: Trust Regions - L.N. Vicente (TA9) Y. Yuan On the convergence of a new trust region algorithm J. Burke Duality theory for trust-region subproblems in mathematical programming L.N. Vicente On the convergence of trust-region-based algorithms for equality constrained optimization SESSION 4: Trust Regions - H. Wolkowicz (TC9) X. Ke A class of nonmonotone trust region algorithms for convex constrained optimization W. Yuan A trust region algorithm for nonlinear equality constrained optimization problems P. Toint Exploring non-monotone line-search and trust-region algorithms for nonlinear optimization SESSION 5: Nonlinear Programming - E. Galperin (TD9) J. Korycki Convergence analysis for norm relaxed method of feasible directions E. Galperin The fast cubic algorithm M.-R. Shi An active set method for unconstrained and linearly constrained $L_1$ norm minimization SESSION 6: Nonlinear Programming - M.V. Ramana (WA9) N. Alexandrov Progress in multilevel algorithms for nonlinear optimization D. Feng Tensor methods for nonlinear equality constrained optimization M.V. Ramana An algorithm for convex matrix inequalities SESSION 7: Nonlinear Programming - K.A. Ariyawansa (WC9) B.W. Smith Metric and model based SR1 updates Y. Xiao A nonmonotone quasi-Newton method for nonlinear systems of equations K.A. Ariyawansa On collinear scaling algorithms that extend quasi-Newton methods SESSION 8: Nonlinear Programming - B.S. Goh (RA9) S. Loskovska A new method for nonlinear optimization - experiment results A. Dax Relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy - A review B.S. Goh Algorithms and methods for unconstrained optimization via optimal control SESSION 9: Nonlinear Programming - J. More (RC9) J.-P. Dussault Augmented penalty algorithms W. Murray Negative curvature for problems with nonlinear constraints J. More Global methods for nonlinear complementarity problems SESSION 10: Constrained Nonlinear Programming - J. Nocedal - (RD9) T. Plantenga Extending interior point method to nonlinear programming using trust regions F. Prieto Second derivative methods for nonlinearly constrained approximation J.C. Gilbert Piecewise line-search techniques for quasi-Newton methods in constrained optimization NONSMOOTH OPTIMIZATION SESSION 1: Variational Analysis and Discretization - R.T. Rockafellar (WC16) J.C. Dunn L2 - Local optimality sufficient conditions and related convergence theorems for gradient projection methods B. Mordukhovich Discretization and variational analysis for differential inclusion R.T. Rockafellar Lagrangian variational inequalities and decomposition SESSION 2: Nonsmooth Analysis - R. Poliquin (RA16) R.A. Poliquin A partial extension of Attouch's theorem for nonconvex functions B. Mordukhovich Analysis and applications of nonconvex subdifferential in infinite dimensions R. Henrion Topological characterization of the approximate subdifferential SESSION 3: Nonsmooth Optimization - C. Lemarechal (RC16) R. Correa Subdifferential monotonicity as characterization of convex functions C. Sagastizabal Practical aspects of the Moreau-Yosida regularization I: theoretical properties C. Lemarechal Practical aspects of the Moreau-Yosida regularization II: numerical considerations SESSION 4: Nonsmooth Optimization - M.D. Grigoriadis (RD16) H. Kawasaki A formula for directional derivatives of a sup-type function with an application to best approximation I. Konnov Combined relaxation methods and their complexity estimates M.D. Grigoriadis Coordination complexity of parallel Lagrangian decomposition SESSION 5: Nonsmooth Analysis - A. Jofre (RF16) A. Peritti Performance of a nonsmooth minimization method based on the generalized monotone derivative S.K. Mishra Generalized pseudoconvexity and duality in multiobjective nonsmooth programming A. Jofre A nonconvex separation property and some consequences in general equilibrium theory in economics SESSION 6: Vector Optimization - D. Dentcheva (FA16) D.K. Bhattacharya Proper efficiency and vector optimization on a Banach Space V. Gorokhovik First and second order optimality conditions in nonsmooth vector optimization D. Dentcheva On stability and well-posedness in the vector optimization problem SESSION 7: Variational Analysis and Discretization - A. Dontchev (FC16) A. Dontchev Constructive approximations in nonlinear optimal control R. Vinter Discrete approximation and the Hamilton Jacobi iteration of optimal control V. Zeidan Generalized Hessian for $C^{1+}$ functions SESSION 8: Nonsmooth Optimization 1 - B. Mordukhovich (FD16) D. Ward Parabolic second-order directional derivatives of the marginal function A. Shapiro A variational principle and its application to asymptotic analysis of stochastic programs J.S. Treiman Optimality conditions with a small generalized gradient SESSION 9: Nonsmooth Optimization - N.Z. Shor (FF16) N.Z. Shor Nonmonotonic-subgradient methods with space dilatation A. Lewis Eigenvalue optimization and subdifferentials J.-S. Pang Piecewise smoothness, local invertability, and parametric analysis of normal maps OPTIMIZATION IN CONTROL SESSION 1: Optimization in Control - G.W. Weber (MC8) F. Troltzsch Second order sufficient conditions and nonlinear parabolic optimal control problems Z. Ding Optimal Boundary control problem of linear Stokes equation with point observations G.W. Weber Structural stability and classification on nonlinear optimal control SESSION 2: Optimization in Control - W. Alt (MI8) S. Ito The use of path-following algorithms for solving continuous-time optimal control problems J. Faco On large scale nonlinear programming techniques for solving optimal control problems W. Alt The Lagrange-Newton method for nonlinear optimal control problems SESSION 3: Optimization in Control - A.M.J. Skulimowski (TA8) J. Mari Local structure of equality constrained nonlinear programming problems and control of stiff ODEs with biotechnical applications D. Kraft Design of robot controls by sequential quadratic programming A.M.J. Skulimowski Quantitative information structures for solving multicriteria optimal control problems SESSION 4: Optimization in Control - B. Polyak (TC8) H.B. Nembhard Transient period process control for continuous manufacturing W. Roemisch Rates of convergence of discrete approximations to constrained nonlinear optimal control problems B. Polyak Optimization problems arising in robust stability theory SESSION 5: : Optimization in Control - L. Goellmann (TD8) V. Bistrickas Discrete and continuous maximum principle in discrete multistage optimization L. Goellmann Direct SQP methods for solving optimal control problems with delays N. Karabakal A steepest descent multiplier adjustment method for the generalized assignment problem PARALLEL COMPUTATION SESSION 1: Parallel Computation A.G. Buckley (MC19) G. Thompson Solving combinatorial problems on massively parallel computers I. Chabini Quadratic based primal-dual algorithms for multicommodity convex and linear cost transportation problems with serial and parallel implementations A.G. Buckley A parallel algorithm for unconstrained optimization without computation of derivatives SESSION 2: Parallel Computation - M.C. Ferris (MI19) W. Martin Advances in Monte-Carlo methods for high performance computer architectures S. Zenios Parallel decomposition of structured matrices arising in stochastic programming problems M.C. Ferris Partitioning mathematical programs for parallel solution SESSION 3: Parallel Computation- K. Kiwiel (TA19) G. MacDonald The impact of modern computer architectures on the design and performance of LP codes D. Zhou Processor assignment problem in distributed computing K. Kiwiel Free-steering relaxation methods for problems with strictly convex costs and linear constraints PIECEWISE LINEAR METHODS SESSION 1: Piecewise Linear Programming - R. Fourer (RF9) M. Gendreau General interactive fixed charge piecewise linear programming using tabu search R. Fourer Issues of piecewise linearity in dual and primal-dual methods Y. Smeers Numerical experiments with piece-wise linear programming in large sparse models POLYHEDRAL COMBINATORICS SESSION 1: Set Covering - S. Ceria (MC3) S. Ceria Solving set covering problems with general cutting planes V. Chandru Rank facets of the set covering polytope P. Nobili Weak cutset composition of covering polytopes SESSION 2: Polyhedral Computations - M. Juenger (MI3) S. Ceria Mixed 0-1 programming by lift-and-project in a branch and cut framework S. Thienel An object oriented framework for branch and cut algorithms T. Christof PORTA - A software package for polyhedral combinatorics SESSION 3: Capacitated Lot-Sizing and Network Design - L. Wolsey (TA3) P. Mirchandani Reformulating the capacitated network design problem D. Bienstock Capacitated network design - polyhedral structure and computation D.X. Shaw A pseudo-polynomial algorithm for single item capacitated economic lot sizing with general cost structure SESSION 4: Cuts - M.Laurent (TC3) A. Deza On the skeleton of the dual cut polytope B. Gerards On t-perfect graphs V.S. Ramakrishnan Minimizing submodular functions over families of sets SESSION 5: Semidefinite programming in Combinatorial Optimization - M. Goemans (TD3) D. Williamson Improved approximation algorithms for MAX CUT, MAX 2SAT, and MAX DICUT using semidefinite programming G. Pataki On the multiplicity of optimal eigenvalues D. Karger Approximate graph coloring by semidefinite programming SESSION 6: The Traveling Salesman Problem - G. Rinaldi (TF3) M. Juenger Experimental contributions to the traveling salesman problem J.M. Clochard Study of alternate strategies for a branch and cut code for the symmetric traveling salesman problem D. Naddef Fast and efficient separation routines for a branch and cut code for the symmetric traveling salesman problem SESSION 7: Design of Communication Networks - M. Stoer (WA3) L. Gouveia An extended flow-based formulation for the capacitated minimal spanning tree problem M. Goemans Primal-dual approximation algorithms for the survivable network design problem M. Stoer Capacity design of communication networks SESSION 8: 0/1 Polytopes Associated with Transitivity Relations I - Y. Wakabayashi (WC3) A. Gurgel The complete pre-order polytope G. Reinelt The linear ordering problem: polytope and computations R. Mueller The interval order polytope of a digraph SESSION 9: 0/1 Polytopes Associated with Transitivity Relations II - R. Mueller (RA3) N. Ascheuer A branch & cut approach to the sequential ordering problem M. Penn On dicycle packings and the linear ordering polytope Y. Wakabayashi Three-dimensional packing algorithms with asymptotic performance analysis SESSION 10: Complete Description of Special Polytopes 1 - G. Reinelt (RC3) R. Euler On linear descriptions of stable-state polyhedra for claw-free graphs R. Weismantel The 0/1 knapsack polytope S. Chopra Complete description of some graph partitioning polytopes SESSION 11: Complete Description of Special Polytopes 2 - R. Weismantel (RD3) D. Alevras Order preserving and contiguous assignment polytopes A. Martin Optimum path packing on wheels: the noncrossing case A. Galluccio The rank facets of the stable set polytopes for claw-free graphs SESSION 12: Cuts and Multicuts with Side Constraints - M. Groetschel (RF3) R. Weismantel The node capacitated graph partitioning problem: polyhedral investigations L. Wolsey The node capacitated graph partitioning problem: a computational study M. Laurent A positive semidefinite relaxation of the cut polytope SESSION 13: Design of Main Frame Computers - D. Bienstock (FA3) M. Groetschel On integer programs that arise in the design of main frame computers A. Martin Solving multiple knapsack problems by cutting planes C. Ferreira Polyhedral studies for the multicut problem in hypergraphs SESSION 14: Set Partitioning - P. Nobili (FC3) R. Borndoerfer Solving set partitioning problems arising in handicapped people's transport E. Kiselyova On continuos problems of the optimal partitioning of sets M. Oosten The polytope of block diagonal matrices and complete bipartite partitionings SESSION 15: Vertex Packing and Related Problems - E. Balas (FD3) P. Hammer Finding the optimal values of some of the variables in SAT or MAX-SAT problems J. Xue Strong bounds for the maximum clique problem B. Guenin Perfect 0,q1 matrices SESSION 16: Polyhedral Combinatorics - M. Conforti (FF3) C. De Francesco Perfect $0,\pm 1$ matrices M. Fischetti Odd cut-sets, odd cycles, and 0-1/2 Chvatal-Gomory cuts G. Savard Concavity cuts for linear maxmin problems SESSION 17: Cutting and Packing Problems - L.E. Trotter (MC6) M. Arenales Approaches to cutting / packing problems K. Xu A bin-packing problem with item size in the interval (0,a) for a < 1/2. S. Magnusson Pattern constrained cutting stock problems SESSION 18: Travelling Salesman Problem - M. Goemans (MI6) A. Sarangarajan All 0/1 polytopes are traveling salesman polytopes C. Stein Approximation algorithms for the maximum traveling salesman problem M. Goemans Worst-case comparison of valid inequalities for the TSP SESSION 19: Polyhedral Combinatorics - E. Balas (TA6) Y.T. Ikebe Ideal polytopes and face structures of some combinatorial optimization problems F. Margot Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron M. Oosten On the dimension of projected polyhedra SESSION 20: Polyhedral Combinatorics - S. Boyd (TC6) A. Lucena Steiner problems in graphs: Lagrangian relaxation and strong valid inequalities R. Wong The Steiner tree problem with a budget constraint S. Boyd Transforming clique tree inequalities to induce facets for the 2-edge connected polytope SESSION 21: Polyhedral Combinatorics - S. Iwata (TD6) Blank Spot S. Iwata Principal structure of submodular systems and its applications J. Araoz Facets and cuts from additive systems SESSION 22: Polyhedral Combinatorics - W.R. Pulleyblank (TF6) C. Mannino Solving hard set covering problems S. Feltenmark A continuous convex knapsack problem with one convex complicating constraint: the economic dispatch problem W.R. Pulleyblank Strength of cuts for integer programming problems SESSION 23: Polyhedral Combinatorics - W.C. Cunningham (WA6) E. Balas Lifting, projection and the cycle polytope of a directed graph E. Cheng Wheel inequalities and their separation algorithms for the stable set polytope Y. Wang On restricted 2-factor polytopes ROUTING METHODS SESSION 1: Routing Methods - P. Martins (TD16) A. Mingozzi New exact algorithm for the vehicle routing problem P. Martins The vehicle routing problem with two classes of vehicles and a limit on the number of vehicles in each class L. Bodin Vehicle routing and scheduling problems over street networks SESSION 2: Routing Methods - A. Loebel (TF16) M.C. Mourao Heuristic methods for a refuse collection vehicle routing problem P. Harker Control of railroad operations: algorithms and economics A. Loebel Solving very large vehicle scheduling problems in public mass transit SATISFIABILITY PROBLEM SESSION 1: Satisfiability Problem - E. Speckenmeyer (FC8) I. Schiermeyer Solving 3-satisfiability in less than 1,579n steps A. Goerdt On the average case complexity of satisfiability algorithms P. Heusch On the contradictoricity of some classes of Horn formulas SESSION 2: Propositional Satisfiability - G. Gallo (FD8) H.K. Buening SAT - Problems and reductions with respect to the number of variables K. Andersen Lower and upper bounds on probabilities of atomic propositions associated with digraphs G. Gallo Maximum satisfiability and minimum cuts on directed hypergraphs SESSION 3: Satisfiability J. Franco (FF8) J. Franco Survey of satisfiability average case results using the random-width model J. Rosenthal Transition phenomena for the satisfiability and related problems S. Suen Analysis of two simple heuristics on a random instance of k-SAT SENSITIVITY ANALYSIS SESSION 1: Sensitivity Analysis of Variational Systems - J.C. Dunn (WA16) A.D. Ioffe Analysis of nonisolated solutions in nonlinear programming R. Cominetti Perturbed optimization in Banach spaces under directional constraint qualification conditions R. Zhang On functions with strong minima SESSION 2: Sensitivity Analysis I - A. Dontchev (RD4) J. Borwein Viscosity subderivatives - theory and applications W. Roemisch Sensitivity analysis in two-stage stochastic programming A. Shapiro Sensitivity analysis of semi-infinite programs SESSION 3: Sensitivity Analysis II - J. Guddat (RF4) H. Th. Jongen On global stability in nonlinear optimization F. Twilt On the critical set of one-parameter quadratic optimization problem D. Klatte Quantitative stability of optimal solutions in nonlinear optimization SESSION 4: Sensitivity Analysis IV - A. Fiacco (FA4) H. Maurer Sensitivity analysis for parametric nonlinear control problems with control-state variables R. Schultz Approaching to quantitative stability in stochastic integer programming A. Fiacco Degeneracy in NLP and the development of results motivated by its presence SESSION 5: Sensitivity Analysis V - S. Vogel (FC4) H. Hu Quantitative stability in semi-infinite programming J. Ruckmann Stability properties of stationary points and feasible sets in semi-infinite optimization S. Vogel Stability in stochastic programming - sufficient conditions for Epi and continuous convergence SESSION 6: Sensitivity Analysis - P. Alfredsson (FD4) H. Zheng Qualitative sensitivity analysis for monotropic programming A.B. Levy Sensitivity analysis of solutions to generalized equations P. Alfredsson Calculating parameter sensitivities in repairable item inventory systems SESSION 7: Sensitivity Analysis - H. Th. Jongen (FF4) J.-P. Penot Sensitivity analysis of general mathematical programming problems H. Gunzel On the topology of the Karush-Kuhn-Tucker set H. Th. Jongen On the Karush-Kuhn-Tucker set in parametric optimization SEQUENCING AND SCHEDULING SESSION 1: Sequencing and Scheduling - H. Alfares (TA10) K. Brinschwitz Applying stochastic programming to multi-facility production scheduling with uncertain yield H. Ramalhinho The one-machine problem with lags H. Alfares An efficient two-phase algorithm for manpower days-off scheduling SESSION 2: Sequencing and Scheduling - V. Timkovsky (TF10) Y. Arzi A linear programming based on-line scheduling procedure for a flexible manufacturing cell B. MacCarthy A new mathematical programming model for scheduling flexible manufacturing systems V. Timkovsky The complexity of unit-time job-shop scheduling SESSION 3 Sequencing and Scheduling - D. Roper (WA10) S. Ricciardelli An exact algorithm for resource constrained project scheduling problems M. Wennink Local search for a generalization of the jobshop problem D. Roper Polynomial-time algorithms for unit execution-time scheduling problems SESSION 4: Sequencing and Scheduling - J.K. Lenstra (RA10) J.A. Hoogeveen Using positional times to solve a two-machine flowshop problem involving batching and scheduling K. Neumann Scheduling with stochastic GERT precedence constraints J.K. Lenstra Bounds for multiprocessor flow shops SESSION 5: Sequencing and Scheduling - Y. Lee (RF10) T. Szantai A multi time period optimization model for obtaining an optimal maintenance policy for the Hungarian road system B. Vizvari On the $\mid\mid C_{\max}$ problem Y. Lee AWAS: A dynamic work scheduling system SESSION 6: Sequencing and Scheduling - H. Braesel (FA10) M. Van Den Akker Column generation for single-machine scheduling problems O.S. Benli Streaming a single job in a flow shop H. Braesel A new world of sequences and schedules SESSION 7: Sequencing and Scheduling - F. Leung (FD10) P. Dellolmo Exact and heuristic algorithms for the jump number problem N. Piersma A probabilistic analysis of parallel machine scheduling F. Leung Using delay-time analysis to study the maintenance problem of gearboxes SESSION 8: Production Planning and Scheduling - M.E. Captivo (FF10) S. Awoniyi A combinatorial procedure for selecting production processes satisfying given tolerance conditions M.E. Captivo A production planning system for the paper industry J. Zhang A bi-level programming method for pipe network optimization SQP SESSION 1: SQP - P.T. Boggs (RC20) C.T. Lawrence Nonlinear equality constraints in feasible sequential quadratic programming P.Armand A piecewise line-search method for maintaining the positive definiteness of the matrices in the SQP method P.T. Boggs Algorithmic enhancements and experience with a large scale SQP code for general nonlinear programming problems SESSION 2: SQP - C.T. Lawrence (RD20) P. Spellucci A new mixed SQP/SEQP method R.W.H. Sargent A new SQP algorithm for nonlinear programming C.T. Lawrence CFSQP: A C code for feasible sequential quadratic programming SESSION 3: SQP - J.E. Rogers (RF20) M. Heinkenschloss Projected sequential quadratic programming methods E.W. Sachs Quasi-Newton methods and the design of output feedback controllers J.E. Rogers An interior-point method for general large scale quadratic programming problems STOCHASTIC METHODS SESSION 1: Probabilistic Analysis of Algorithms - D. Simchi-Levi (TD5) W.T. Rhee On rates of convergence for common subsequences and first passage time D. Bertsimas Linear programming relaxations, approximation algorithms and randomization: a unified view of coloring problems D. Simchi-Levi Probabilistic analysis and practical algorithms for the vehicle routing problem with capacity and time windows constraints SESSION 2: Applications in Global Optimization - Z. Zabinsky (TF5) C.A. Floudas Global optimization for the phase stability problem B.P. Kristinsdottir Sensitivity of global design due to manufacturing tolerances L. Contesse-Becker A convergence result for the partial Lagrangian penalty method for nonstrictly binding constraints SESSION 3: Probabilistic Preprocessing - R. Caron (WA5) R. Caron Preprocessing linear programmes: the stand-and-hit algorithm A. Boneh Improvements to the stand-and-hit algorithm S. Boneh Predicting the number of unseen species SESSION 4: Global Optimization - V. Korotkich (WC5) E. Hendrix Heuristics for multiextremal optimization on a hyperrectangle: Some experiments M. Potapov Global optimization problems solving in optimization media V. Korotkich Random walk complexity quantization for global search SESSION 5: Heuristic Search - E. Romeijn (RA5) L. Stougie Hit-and-run, an FPRAS for volume computations of convex bodies D. Kaufman Adaptive direction choice in random search continuous global optimization J. Mount A markov chain approach to optimization SESSION 6: Infinite Programming - R.L. Smith (RC5) E.J. Anderson Purification for separated continuous linear programs E. Romeijn Shadow prices in infinite dimensional linear programming I.E. Schochetman Solution existence for infinite quadratic programming: The positive semi-definite case STUDENT PROGRAMS SESSION 1: Student Sessions 1: Introduction to MP - A. Benjamin (MC10) S. Savage Introduction to optimization: what if vs what's best A. Benjamin Introduction to duality - the SOB method W.F. Lucas Introduction to linear programming: coalitional game experiments SESSION 2: Student Sessions: MP in Transportation - C. Barnhart (MI10) M. Ball Routing and scheduling over street networks D. Bertsimas The flow management problem in air traffic control C. Barnhart Optimization in the airline industry SESSION 3: Student Sessions: MP in Algebra and Number Theory - A. Barvinok (TC10) J. Lagarias George Boole's work on linear programming and maximum entropy L. Lovasz Polynomials and integer programming B. Sturmfels Groebner basis methods in integer programming SESSION 4: Student Sessions: MP in Analysis - J. Borwein (TD10) A. Lewis Dual ways of thinking about analysis H. Bauschke Projection methods: results and open problems M. Limber Applications of optimization in medical imaging SESSION 5: Student Sessions: MP in Design - P. Papalambros (WC10) P. Kulkarni Optimization of a machine tool gearbox S.A. Nelson Strain gage selection in loads using a genetic algorithm R. Johanson Structural layout optimization in project MAXWELL SESSION 6: Student Sessions: MP in Manufacturing - R. Srinivasan (RC10) Y. Bassok Long term supply contracts) R.J. Wittrock Industrial strength LP: A production case study S. Tayur Stochastic programming approaches for some manufacturing problems: Models and solutions SESSION 7: Student Sessions: MP in Finance - J. Mulvey (RD10) S. Nielsen Designing Financial Products J. Mulvey Asset-reliability planning systems using stochastic optimization R.M. Nauss Integer programming applications: bond trading, mortgage backed security financing, and FASB 115 accounting SESSION 8: Student Sessions: MP in Telecommunications - R. Wong (FC10) J.S. Park Mathematical modeling and solution algorithms for LAN interconnection problems S. Sen A stochastic decomposition approach to network planning under uncertainty R. Wong Mathematical programming and telecommunictions network design: the design of access networks SESSION 9: Student Sessions: MP in Logistics - W. Powell (FD19) W. Powell Optimization models for real-time logistics: replacing the dispatcher-savant TRIANGULATIONS AND SIMPLICIAL METHODS SESSION 1: Triangulations and Simplicial Methods - V.P. Bulatov (FA20) C.-H. Wu Restricted simplicial decomposition with side constraints and its application to capacitated multicommodity networks Z. Yang A simplicial algorithm for computing robust station points of a continuous function on the unit sphere V.P. Bulatov An acceleration of convergence of simplex imbeddings method SESSION 2: Triangulations and Simplicial Methods - D. Sutherland (FF20) G. van der Laan Intersection theorem on polytopes G. Parija A method for generating the facet of underlying polytopes in positive 0/1 integer programs D. Sutherland The offset problem and linear programming VARIATIONAL INEQUALITIES SESSION 1: Variational Inequalities - P. Marcotte (MC14) J.H. Wu A long step primal path following algorithm for some monotone variational inequality problems J.-S. Pang An interior point method for mathematical programs with equilibrium constraints P. Marcotte An interior point method for pseudomonotone variational inequalities SESSION 2: Variational Inequalities and Complementarity Problems - Dedicated to Professor Richard J. Cottle on the occasion of his 60th birthday - J.-S. Pang (MI14) O.L. Mangasarian A class of smoothing functions for nonlinear complementarity problems and variational inequalities S.M. Robinson Normal map techniques for variational inequalities M.S. Gowda On the extended linear complementarity problem SESSION 3: Algorithms for Variational Inequalities and Complementarity Problems - Z.-Q. Luo (TA14) P. Tseng Projection-type methods for monotone variational inequality problems T. Magnanti Averaging schemes for solving fixed point and variational inequality problems S. Dirkse The PATH solver: A stabilized Newton method for mixed complementarity problems SESSION 4: Engineering and Equilibrium Applications of Nonlinear Complementarity Problems - M.C. Ferris (TC14) F. Tin-Loi Nonlinear structural analysis as a complementarity problem S. Gabriel The National Energy Modeling System: A large-scale equilibrium model at the U.S. Department of Energy G. Bjorkman The treatment of contact problems as a nonlinear complementarity problem SESSION 5: Sensitivity Analysis of Variational Inequalities -S. M. Robinson (TD14) B. Mordukhovich Stability analysis for variational systems by means of generalized differentiation B. Kummer A parametric version of Kojima's optimality system; regarding solvability and application S. Scholtes Mathematical programs with equilibrium constraints: Linearization, constraint qualifications, and exact penalization SESSION 6: Interior Point Methods - P. Tseng (TF14) R. Womersley A parallel inexact Newton method for stochastic programs with recourse O. Guler, Constructing barrier function for interior point methods I. Sobolevsky Application of Lagrange approach for investigation of linear control problems with mixed constraints in discrete time SESSION 7: Differentiable versus Nonsmooth Approach to Variational Inequalities - M.S. Gowda (WA14) L. Qi Newton's Methods for LC1 optimization problems and nonsmooth variational inequalities P. Tseng Growth behaviour of a class of merit functions for LCP R.W. Cottle On solving linear complementarity problems with sufficient matrices by Lemke's method SESSION 8: Variational Inequalities - D. Gao (WC14) S. Kalashnikov Parameter driving methods to study equilibrium T. Friesz Infinite dimensional variational inequalities and dynamic network disequilibrium modeling D. Gao Multi-duality in variational inequalities and complementarity problems SESSION 9: Variational Inequalities - J. Zhou (RA14) Blank Spot J. Zhou Constrained LQR problems in distributed control systems with point observations - a variational inequality approach T. Rutherford Extensions of GAMS for complementarity problems arising in applied economic analysis SESSION 10: Combinatorics and Optimization - S. Pickenhain (RC14) C. Van Eijl Valid inequalities for the discrete lot-sizing problem S. Pickenhain Second order sufficient optimality conditions and minimizing cones for a class of weak variational problems J. Mount Application of convex sampling to optimization SESSION 11: Variational Inequalities - L.-J. Lin (FC6) J. Outrata Optimization problems with quasi-variational inequality constraints S. Kalashnikov Solving two-level variational inequality L.-J. Lin Pre-vector variational inequality