default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel E. Steffy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Ambros M. Gleixner
, Daniel E. Steffy:
Linear programming using limited-precision oracles. Math. Program. 183(1): 525-554 (2020)
2010 – 2019
- 2019
- [j14]Sunil Chopra, Sangho Shim, Daniel E. Steffy:
A concise characterization of strong knapsack facets. Discret. Appl. Math. 253: 136-152 (2019) - [c6]Ambros M. Gleixner, Daniel E. Steffy:
Linear Programming Using Limited-Precision Oracles. IPCO 2019: 399-412 - [i2]Ambros M. Gleixner, Daniel E. Steffy:
Linear Programming using Limited-Precision Oracles. CoRR abs/1912.12820 (2019) - 2018
- [j13]Karimah Sweet, Li Li, Eddie Cheng, László Lipták, Daniel E. Steffy:
A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 34(1): 241-260 (2018) - 2017
- [j12]Eddie Cheng, Li Li, László Lipták, Sangho Shim, Daniel E. Steffy:
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 33(1): 85-102 (2017) - [c5]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. IPCO 2017: 148-160 - [c4]Matthias Miltenberger, Ted K. Ralphs, Daniel E. Steffy:
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization. OR 2017: 151-157 - 2016
- [j11]Ambros M. Gleixner, Daniel E. Steffy, Kati Wolter:
Iterative Refinement for Linear Programming. INFORMS J. Comput. 28(3): 449-464 (2016) - [j10]Fatma Kilinç-Karzan, Daniel E. Steffy:
On sublinear inequalities for mixed integer conic programs. Math. Program. 159(1-2): 585-605 (2016) - [i1]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. CoRR abs/1611.08832 (2016) - 2013
- [j9]Daniel E. Steffy, Kati Wolter:
Valid Linear Programming Bounds for Exact Mixed-Integer Programming. INFORMS J. Comput. 25(2): 271-284 (2013) - [j8]Eddie Cheng, László Lipták, Daniel E. Steffy:
Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges. Inf. Process. Lett. 113(12): 452-456 (2013) - [j7]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3): 305-344 (2013) - [j6]Eddie Cheng, Shalin Shah, Vyom Shah, Daniel E. Steffy:
Strong matching preclusion for augmented cubes. Theor. Comput. Sci. 491: 71-77 (2013) - [c3]Daniel E. Steffy:
Exact linear and integer programming: tutorial abstract. ISSAC 2013: 11-12 - 2012
- [j5]Tony Shaska, Daniel E. Steffy:
East coast computer algebra day 2012 abstracts. ACM Commun. Comput. Algebra 46(1/2): 55-59 (2012) - [c2]Ambros M. Gleixner, Daniel E. Steffy, Kati Wolter:
Improving the accuracy of linear programming solvers with iterative refinement. ISSAC 2012: 187-194 - 2011
- [j4]Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [j3]William J. Cook, Daniel E. Steffy:
Solving Very Sparse Rational Systems of Equations. ACM Trans. Math. Softw. 37(4): 39:1-39:21 (2011) - [c1]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
An Exact Rational Mixed-Integer Programming Solver. IPCO 2011: 104-116 - 2010
- [j2]Daniel E. Steffy:
Exact solutions to linear systems of equations using output sensitive lifting. ACM Commun. Comput. Algebra 44(3/4): 160-182 (2010)
2000 – 2009
- 2005
- [j1]Eddie Cheng, William A. Lindsey, Daniel E. Steffy:
Maximal vertex-connectivity of. Networks 46(3): 154-162 (2005)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 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:
