|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11 occurrences of 9 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alper Atamtürk, Kiavash Kianfar |
n-step mingling inequalities: new facets for the mixed-integer knapsack set.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Vishnu Narayanan |
Lifting for conic mixed-integer programming. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shabbir Ahmed, Alper Atamtürk |
Maximizing a class of submodular utility functions. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Selim Aktürk, Alper Atamtürk, Sinan Gürel |
Parallel machine match-up scheduling with manufacturing cost considerations. |
J. Scheduling |
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 | Alper Atamtürk, Vishnu Narayanan |
Conic mixed-integer rounding cuts. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C11, 90C25, 90C57 |
| 1 | M. Selim Akturk, Alper Atamtürk, Sinan Gurel |
A strong conic quadratic reformulation for machine-job assignment with controllable processing times. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Vishnu Narayanan |
The submodular knapsack polytope. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Simge Küçükyavuz |
An O(n2) algorithm for lot sizing with inventory bounds and fixed costs. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Vishnu Narayanan |
Polymatroids and mean-risk minimization in discrete optimization. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Deepak Rajan |
Partition inequalities for capacitated survivable network design based on directed p-cycles. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Muhong Zhang |
The Flow Set with Partial Order. |
Math. Oper. Res. |
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 | Alper Atamtürk, Muhong Zhang |
Two-Stage Robust Network Flow and Design Under Demand Uncertainty. |
Operations Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Vishnu Narayanan |
Cuts for Conic Mixed-Integer Programming. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
Integer programming, branch-and-cut, conic programming |
| 1 | Alper Atamtürk |
Strong Formulations of Robust Mixed 0-1 Programming. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 93B35, 90C11, 90C47 |
| 1 | Alper Atamtürk, Simge Küçükyavuz |
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation. |
Operations Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Martin W. P. Savelsbergh |
Integer-Programming Software Systems. |
Annals OR |
2005 |
DBLP DOI BibTeX RDF |
algebraic modeling languages, software, integer programming |
| 1 | Alper Atamtürk |
Cover and Pack Inequalities for (Mixed) Integer Programming. |
Annals OR |
2005 |
DBLP DOI BibTeX RDF |
knapsack polyhedra, superadditive functions, integer programming, lifting |
| 1 | Deepak Rajan, Alper Atamtürk |
A directed cycle-based column-and-cut generation method for capacitated survivable network design. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk |
Sequence Independent Lifting for Mixed-Integer Programming. |
Operations Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Juan Carlos Muñoz |
A study of the lot-sizing polytope. |
Math. Program. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk |
On the facets of the mixed-integer knapsack polyhedron. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, Deepak Rajan |
On splittable and unsplittable flow capacitated network design arc-set polyhedra. |
Math. Program. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk |
On capacitated network design cut-set polyhedra. |
Math. Program. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk |
Flow pack facets of the single node fixed-charge flow polytope. |
Oper. Res. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh |
Conflict graphs in solving integer programming problems. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh |
Valid Inequalities for Problems with Additive Variable Upper Bounds. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")