default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Kipp Martin
Person information
- affiliation: University of Chicago, Booth School of Business
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j23]Amitabh Basu
, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. Math. Oper. Res. 44(4): 1264-1285 (2019)- 2017
- [j22]Amitabh Basu, Richard Kipp Martin, Christopher Thomas Ryan:
Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. 161(1-2): 451-485 (2017) - [c1]Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. IPCO 2017: 75-85 - 2016
- [j21]Horand I. Gassmann, Jun Ma, Richard Kipp Martin:
Communication protocols for options and results in a distributed optimization environment. Math. Program. Comput. 8(2): 161-189 (2016) - [j20]R. Kipp Martin, Christopher Thomas Ryan, Matt Stern:
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization. SIAM J. Optim. 26(1): 111-138 (2016) - 2015
- [j19]Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan:
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. Math. Oper. Res. 40(1): 146-170 (2015) - 2014
- [j18]Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan:
On the sufficiency of finite support duals in semi-infinite linear programming. Oper. Res. Lett. 42(1): 16-20 (2014) - 2013
- [j17]Miles Lubin, R. Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi:
On parallelizing dual decomposition in stochastic integer programming. Oper. Res. Lett. 41(3): 252-258 (2013) - 2010
- [j16]Robert Fourer, Jun Ma, R. Kipp Martin:
OSiL: An instance language for optimization. Comput. Optim. Appl. 45(1): 181-203 (2010) - [j15]R. Kipp Martin:
Tutorial: COIN-OR: Software for the OR Community. Interfaces 40(6): 465-476 (2010) - [j14]Robert Fourer, Jun Ma, R. Kipp Martin:
Optimization Services: A Framework for Distributed Optimization. Oper. Res. 58(6): 1624-1636 (2010)
2000 – 2009
- 2009
- [j13]Robert Fourer, Horand I. Gassmann, Jun Ma, R. Kipp Martin:
An XML-based schema for stochastic programs. Ann. Oper. Res. 166(1): 313-337 (2009) - 2005
- [j12]Robert Fourer, Leo Lopes, R. Kipp Martin:
LPFML: A W3C XML Schema for Linear and Integer Programming. INFORMS J. Comput. 17(2): 139-158 (2005)
1990 – 1999
- 1999
- [b1]Richard Kipp Martin:
Large scale linear and integer optimization - a unified approach. Kluwer 1999, ISBN 978-0-7923-8202-7, pp. I-XVII, 1-140 - 1997
- [j11]Mohan Bala, R. Kipp Martin:
A Mathematical Programming Approach to Data Base Normalization. INFORMS J. Comput. 9(1): 1-14 (1997) - 1992
- [j10]Robert G. Jeroslow, R. Kipp Martin, Ronald L. Rardin, Jinchang Wang:
Gainfree Leontief substitution flow problems. Math. Program. 57: 375-414 (1992) - 1991
- [j9]R. Kipp Martin:
Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3): 119-128 (1991) - 1990
- [j8]R. Kipp Martin, Ronald L. Rardin, Brian A. Campbell:
Polyhedral Characterization of Discrete Dynamic Programming. Oper. Res. 38(1): 127-138 (1990)
1980 – 1989
- 1989
- [j7]Gary D. Eppen, R. Kipp Martin, Linus Schrage:
OR Practice - A Scenario Approach to Capacity Planning. Oper. Res. 37(4): 517-527 (1989) - 1987
- [j6]R. Kipp Martin:
Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition. Oper. Res. 35(6): 820-831 (1987) - [j5]Gary D. Eppen, R. Kipp Martin:
Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Oper. Res. 35(6): 832-848 (1987) - 1986
- [j4]Gary D. Eppen, R. Kipp Martin, Linus Schrage:
A mixed-integer programming model for evaluating distribution configurations in the steel industry. Comput. Oper. Res. 13(5): 575-586 (1986) - 1985
- [j3]R. Kipp Martin, Dennis J. Sweeney, Michael E. Doherty:
The reduced cost branch and bound algorithm for mixed integer programming. Comput. Oper. Res. 12(2): 139-149 (1985) - [j2]R. Kipp Martin, Linus Schrage:
Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming. Oper. Res. 33(3): 505-526 (1985) - 1983
- [j1]R. Kipp Martin, Dennis J. Sweeney:
An ideal column algorithm for integer programs with special ordered sets of variables. Math. Program. 26(1): 48-63 (1983)
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 2025-01-21 00:02 CET 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:
