Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 94
Volume 94, Number 1, December 2002
- Alexander Shapiro, Tito Homem-de-Mello
, Joocheol Kim:
Conditioning of convex piecewise linear stochastic programs. 1-19 - Adam N. Letchford, Richard W. Eglese, Jens Lysgaard:
Multistars, partial multistars and the capacitated vehicle routing problem. 21-40 - Laura Bahiense, Nelson Maculan, Claudia A. Sagastizábal:
The volume algorithm revisited: relation with bundle methods. 41-69 - François Margot:
Pruning by isomorphism in branch-and-cut. 71-90 - Andreas Fischer:
Local behavior of an iterative framework for generalized equations with nonisolated solutions. 91-124 - François Vanderbeck:
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem. 125-136 - Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Maximum stable set formulations and heuristics based on continuous optimization. 137-166 - Defeng Sun, Robert S. Womersley, Houduo Qi:
A feasible semismooth asymptotically Newton method for mixed complementarity problems. 167-187
Volume 94, Numbers 2-3, January 2003
- Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
The Aussois 2000 workshop in combinatorial optimization introduction. 189-191 - Martin Henk, Matthias Köppe, Robert Weismantel:
Integral decomposition of polyhedra and some applications in mixed integer programming. 193-206 - François Margot:
Small covering designs by branch-and-cut. 207-220 - Egon Balas, Michael Perregaard:
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. 221-245 - Jon Lee, Joy Williams:
A linear integer programming bound for maximum-entropy sampling. 247-256 - Andrea Lodi, Michele Monaci:
Integer linear programming models for 2-staged two-dimensional Knapsack problems. 257-278 - Alberto Caprara, Adam N. Letchford:
On the separation of split cuts and related inequalities. 279-294 - Bram Verweij, Karen I. Aardal:
The merchant subtour problem. 295-322 - Raymond Hemmecke, Rüdiger Schultz:
Decomposition of test sets in stochastic integer programming. 323-341 - Ted K. Ralphs, L. Kopman, William R. Pulleyblank, Leslie E. Trotter Jr.:
On the capacitated vehicle routing problem. 343-359 - Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive scheduling with rejection. 361-374 - Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
On the polyhedral structure of a multi-item production planning model with setup times. 375-405 - Martin Zachariasen, André Rohe:
Rectilinear group Steiner trees and applications in VLSI design. 407-433 - Gunnar W. Klau, Petra Mutzel:
Optimal labeling of point features in rectangular labeling models. 435-458 - S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi:
Easy and difficult objective functions for max cut. 459-466
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-16 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
