|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
The master equality polyhedron with multiple rows.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Santanu S. Dey, Oktay Günlük |
On mixed-integer sets with two integer variables.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Christian Raack |
A note on the MIR closure and basic relaxations of polyhedra.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo Fukasawa, Oktay Günlük |
Strengthening lattice-free cuts using non-negativity.  |
Discrete Optimization  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Gerhard J. Woeginger (eds.) |
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings  |
IPCO  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
MIR closures of polyhedral sets.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification (2000) 90C10, 90C57, 90C11 |
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
Erratum to: MIR closures of polyhedral sets.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Oktay Günlük |
Mingling: mixed-integer rounding with bounds.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
On a generalization of the master cyclic group polyhedron.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Jeff Linderoth |
Perspective reformulations of mixed integer nonlinear programs with indicator variables.  |
Math. Program.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük |
Two-Step MIR Inequalities for Mixed Integer Programs.  |
INFORMS Journal on Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan |
A model for fusion and code motion in an automatic parallelizing compiler.  |
PACT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs.  |
SIAM Journal on Optimization  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük |
A pricing problem under Monge property.  |
Discrete Optimization  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
On the strength of Gomory mixed-integer cuts as group cuts.  |
Math. Program.  |
2008 |
DBLP DOI BibTeX RDF |
Mixed integer rounding, Cyclic group polyhedra, Integer programming, Cutting planes |
| 1 | Oktay Günlük, Jeff Linderoth |
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.  |
IPCO  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Oktay Günlük |
Network design arc set with variable upper bounds.  |
Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.  |
SIAM J. Discrete Math.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
On the MIR Closure of Polyhedra.  |
IPCO  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
On a Generalization of the Master Cyclic Group Polyhedron.  |
IPCO  |
2007 |
DBLP DOI BibTeX RDF |
integer programming, polyhedral combinatorics |
| 1 | Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin |
Vehicle Routing and Staffing for Sedan Service.  |
Transportation Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid inequalities based on simple mixed-integer sets.  |
Math. Program.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid inequalities based on the interpolation procedure.  |
Math. Program.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Laszlo Ladányi, Sven de Vries |
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.  |
Management Science  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid Inequalities Based on Simple Mixed-Integer Sets.  |
IPCO  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows.  |
IPCO  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Shiwen Chen, Oktay Günlük, Bülent Yener |
The multicast packing problem.  |
IEEE/ACM Trans. Netw.  |
2000 |
DBLP DOI BibTeX RDF |
multicast congestion, multicast optimization, multicast packing, multicasting, lower bounds |
| 1 | Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai |
Minimum cost capacity installation for multicommodity network flows.  |
Math. Program.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiwen Chen, Oktay Günlük, Bülent Yener |
Optimal Packing of Group Multi-Casting.  |
INFOCOM  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Daniel Bienstock, Oktay Günlük |
Capacitated Network Design - Polyhedral Structure and Computation.  |
INFORMS Journal on Computing  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock, Oktay Günlük |
Computational experience with a difficult mixed-integer multicommodity flow problem.  |
Math. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|