Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 105
Volume 105, Number 1, January 2006
- Richard W. Cottle:
George B. Dantzig: a legendary life in mathematical programming. 1-8 - Daniel Bienstock, Mark Zuckerberg:
Approximate fixed-rank closures of covering problems. 9-27 - Sanjeeb Dash, Oktay Günlük
:
Valid inequalities based on simple mixed-integer sets. 29-53 - Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller:
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. 55-84 - Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. 85-111 - Mihai Anitescu:
Optimization-based simulation of nonsmooth rigid multibody dynamics. 113-143 - J. B. G. Frenk, Gábor Kassay:
The level set method of Joó and its use in minimax theory. 145-155
Volume 105, Number 2-3, February 2006
- Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. 157-160 - Michele Conforti, Giacomo Zambelli:
Recognizing Balanceable Matrices. 161-179 - Francisco Barahona:
Network reinforcement. 181-200 - Kathie Cameron, Pavol Hell:
Independent packings in structured graphs. 201-213 - Dennis Michaels, Robert Weismantel:
Polyhedra related to integer-convex polynomial systems. 215-232 - Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Balanced Graphs. 233-250 - Adam N. Letchford, Juan José Salazar González:
Projection results for vehicle routing. 251-274 - Dirk Müller:
On the complexity of the planar directed edge-disjoint paths problem. 275-288 - Jean Fonlupt, Ali Ridha Mahjoub:
Critical extreme points of the 2-edge connected spanning subgraph polytope. 289-310 - Arnaud Pêcher, Annegret Wagler:
Almost all webs are not rank-perfect. 311-328 - Denis Cornaz:
A linear programming formulation for the maximum complete multipartite subgraph problem. 329-344 - Agostinho Agra, Miguel Fragoso Constantino:
Polyhedral description of the integer single node flow set with constant bounds. 345-364 - Rüdiger Schultz, Stephan Tiedemann:
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse. 365-386 - Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
A branch-and-cut algorithm for multiple sequence alignment. 387-425 - Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. 427-449 - Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov:
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. 451-469 - Roberto De Franceschi, Matteo Fischetti, Paolo Toth:
A new ILP-based refinement heuristic for Vehicle Routing Problems. 471-499 - Mathieu Van Vyve, Laurence A. Wolsey:
Approximate extended formulations. 501-522 - Sergey Shebalov, Diego Klabjan:
Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds. 523-561 - Alexander Martin, Markus Möller, Susanne Moritz:
Mixed Integer Models for the Stationary Case of Gas Network Optimization. 563-582 - Juan José Salazar González:
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. 583-603
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-17 20:31 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:
