Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Fischetti, Matteo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Backdoor branching
Matteo Fischetti
,
Michele Monaci
Lecture Notes in Computer Science
6655
, 2011, pp. 183-191
Can pure cutting plane algorithms work?
Arrigo Zanette
,
Matteo Fischetti
,
Egon Balas
Lecture Notes in Computer Science
5035
, 2008, pp. 416-434
Scheduling with precedence constraints of low fractional dimension
Christoph Ambühl
,
Monaldo Mastrolilli
,
Nikolaus Mutsanas
,
Ola Svensson
Lecture Notes in Computer Science
4513
, 2007, pp. 130-144
Inequalities from two rows of a simplex tableau
Kent Andersen
,
Quentin Louveaux
,
Robert Weismantel
,
Laurence A. Wolsey
Lecture Notes in Computer Science
4513
, 2007, pp. 1-15
Infrastructure leasing problems
Barbara M. Anthony
,
Anupam Gupta
Lecture Notes in Computer Science
4513
, 2007, pp. 424-438
Cuts for conic mixed-integer programming
Alper Atamtürk
,
Vishnu Narayanan
Lecture Notes in Computer Science
4513
, 2007, pp. 16-29
New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing
Egon Balas
,
Pierre Bonami
Lecture Notes in Computer Science
4513
, 2007, pp. 89-103
The smoothed number of Pareto optimal solutions in bicriteria integer optimization
Rene Beier
,
Heiko Röglin
,
Berthold Vöcking
Lecture Notes in Computer Science
4513
, 2007, pp. 53-67
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu
,
Chandra Chekuri
,
Martin Pál
,
Jan Vondrák
Lecture Notes in Computer Science
4513
, 2007, pp. 182-196
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows
Michele Conforti
,
Marco Di Summa
,
Laurence A. Wolsey
Lecture Notes in Computer Science
4513
, 2007, pp. 352-366
Mixed-integer vertex covers on bipartite graphs
Michele Conforti
,
Bert Gerards
,
Giacomo Zambelli
Lecture Notes in Computer Science
4513
, 2007, pp. 324-336
On integer programming and the branch-width of the constraint matrix
William H. Cunningham
,
Jim Geelen
Lecture Notes in Computer Science
4513
, 2007, pp. 158-166
Generating multiple solutions for mixed integer programming problems
Emilie Danna
,
Mary Fenelon
,
Zonghao Gu
,
Roland Wunderling
Lecture Notes in Computer Science
4513
, 2007, pp. 280-294
On a generalization of the Master Cyclic Group Polyhedron
Sanjeeb Dash
,
Ricardo Fukasawa
,
Oktay Günlük
Lecture Notes in Computer Science
4513
, 2007, pp. 197-209
On the MIR closure of polyhedra
Sanjeeb Dash
,
Oktay Günlük
,
Andrea Lodi
Lecture Notes in Computer Science
4513
, 2007, pp. 337-351
Sequential-merge facets for two-dimensional group problems
Santanu S. Dey
,
Jean-Philippe P. Richard
Lecture Notes in Computer Science
4513
, 2007, pp. 30-42
Distinct triangle areas in a planar point set
Adrian Dumitrescu
,
Csaba D. Tóth
Lecture Notes in Computer Science
4513
, 2007, pp. 119-129
Robust combinatorial optimization with exponential scenarios
Uriel Feige
,
Kamal Jain
,
Mohammad Mahdian
,
Vahab Mirrokni
Lecture Notes in Computer Science
4513
, 2007, pp. 439-453
MIPping closures: An instant survey
Matteo Fischetti
,
Andrea Lodi
Graphs and Combinatorics
23
(S1), 2007, pp. 233-243
Finding a polytope from its graph in polynomial time
Eric J. Friedman
Lecture Notes in Computer Science
4513
, 2007, pp. 68-73
On the exact separation of mixed integer knapsack cuts
Ricardo Fukasawa
,
Marcos Goycoolea
Lecture Notes in Computer Science
4513
, 2007, pp. 225-239
The set connector problem in graphs
Takuro Fukunaga
,
Hiroshi Nagamochi
Lecture Notes in Computer Science
4513
, 2007, pp. 484-498
DINS, a MIP improvement heuristic
Shubhashis Ghosh
Lecture Notes in Computer Science
4513
, 2007, pp. 310-323
Triangle-free simple 2-matchings in subcubic graphs
David Hartvigsen
,
Yanjun Li
Lecture Notes in Computer Science
4513
, 2007, pp. 43-52
Computational geometric approach to submodular function minimization for multiclass queueing systems
Toshinari Itoko
,
Satoru Iwata
Lecture Notes in Computer Science
4513
, 2007, pp. 267-279
Seiten 1
2
3
>