Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 98
Volume 98, Numbers 1-3, September 2003
- Gérard Cornuéjols, William R. Pulleyblank:
Integer programming. 1-2 - François Margot:
Exploiting orbits in symmetric ILP. 3-21 - Matteo Fischetti, Andrea Lodi:
Local branching. 23-47 - Dimitris Bertsimas, Melvyn Sim
:
Robust discrete optimization and network flows. 49-71 - Andrew J. Miller, Laurence A. Wolsey:
Tight formulations for some simple mixed integer programs and convex objective integer programs. 73-88 - Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. 89-113 - Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. 115-143 - Alper Atamtürk:
On the facets of the mixed-integer knapsack polyhedron. 145-175 - Todd Easton, Kevin Hooker, Eva K. Lee:
Facets of the independent set polytope. 177-199 - Adam N. Letchford:
Binary clutter inequalities for integer programs. 201-221 - Denis Naddef, Emmanuel Wild:
The domino inequalities: facets for the symmetric traveling salesman polytope. 223-251 - Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
Parallel branch, cut, and price for large-scale discrete optimization. 253-280 - Matthias Köppe, Robert Weismantel:
An algorithm for mixed integer optimization. 281-307 - Sebastián Ceria:
Lift-and-project cuts and perfect graphs. 309-317 - László Lipták, Levent Tunçel:
The stable set problem and the lift-and-project ranks of graphs. 319-353 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. 355-368 - Christoph Buchheim, Michael Jünger:
Detecting symmetries by branch & cut. 369-384 - Ephraim Korach, Michal Stern:
The clustering matroid and the optimal clustering tree. 385-414 - Rainer E. Burkard, Peter Butkovic:
Max algebra and the linear assignment problem. 415-429 - Paolo Serafini:
Asymptotic scheduling. 431-444 - Alberto Caprara, Michele Monaci, Paolo Toth:
Models and algorithms for a staff scheduling problem. 445-476 - Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie:
Approximation algorithms for the test cover problem. 477-491 - Simon Christofides, Alexander Christofides, Nicos Christofides:
The design of corporate tax structures. 493-510
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-25 05:28 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:
