default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDE. Andrew Boyd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j19]Roger Z. Ríos-Mercado
, Seongbae Kim, E. Andrew Boyd:
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures. Comput. Oper. Res. 33: 2323-2351 (2006)- 2004
- [j18]Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd:
Towards the real time solution of strike force asset allocation problems. Comput. Oper. Res. 31(2): 273-291 (2004) - [j17]Chris Born, Monica Carbajal, Pat Smith, Mark Wallace, Kirk Abbott, Surain Adyanthaya, E. Andrew Boyd, Curtis Keller, Jin Liu, Wayne New, Tom Rieger, Bert Winemiller, Ron Woestemeyer:
Contract Optimization at Texas Children's Hospital. Interfaces 34(1): 51-58 (2004) - 2003
- [j16]E. Andrew Boyd, Ioana C. Bilegan:
Revenue Management and E-Commerce. Manag. Sci. 49(10): 1363-1386 (2003) - 2002
- [j15]Roger Z. Ríos-Mercado, Suming Wu, L. Ridgway Scott, E. Andrew Boyd:
A Reduction Technique for Natural Gas Transmission Network Optimization Problems. Ann. Oper. Res. 117(1-4): 217-234 (2002) - [j14]Nicola Secomandi, Kirk Abbott, Tankut Atan, E. Andrew Boyd:
From Revenue Management Concepts to Software Systems. Interfaces 32(2): 1-11 (2002) - 2001
- [c3]Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd:
Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systems. SMC 2001: 3118-3122
1990 – 1999
- 1998
- [j13]E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay:
An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System. INFORMS J. Comput. 10(4): 417-426 (1998) - [j12]Xiao-Qing Yan, E. Andrew Boyd:
Cutting planes for mixed-integer knapsack polyhedra. Math. Program. 81: 257-262 (1998) - [e1]Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado:
Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings. Lecture Notes in Computer Science 1412, Springer 1998, ISBN 3-540-64590-X [contents] - 1997
- [j11]E. Andrew Boyd:
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball. Oper. Res. Lett. 20(2): 59-63 (1997) - 1996
- [j10]E. Andrew Boyd:
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. SIAM J. Discret. Math. 9(3): 365-376 (1996) - 1995
- [j9]E. Andrew Boyd:
Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. Math. Program. 68: 155-168 (1995) - [j8]E. Andrew Boyd:
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming. SIAM J. Optim. 5(2): 421-435 (1995) - 1994
- [j7]E. Andrew Boyd:
Solving 0/1 integer programs with enumeration cutting planes. Ann. Oper. Res. 50(1): 61-72 (1994) - [j6]E. Andrew Boyd:
Fenchel Cutting Planes for Integer Programs. Oper. Res. 42(1): 53-64 (1994) - 1993
- [j5]E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem. Discret. Appl. Math. 41(3): 185-201 (1993) - [j4]E. Andrew Boyd:
Solving integer programs with Fenchel cutting planes and preprocessing. Neural Parallel Sci. Comput. 1: 453-466 (1993) - [j3]E. Andrew Boyd:
Generating Fenchel Cutting Planes for Knapsack Polyhedra. SIAM J. Optim. 3(4): 734-750 (1993) - [c2]E. Andrew Boyd:
Solving integer programs with Fenchel cutting planes and preprocessing. IPCO 1993: 209-220 - 1992
- [j2]E. Andrew Boyd:
A pseudopolynomial network flow formulation for exact knapsack separation. Networks 22(5): 503-514 (1992) - 1990
- [j1]E. Andrew Boyd, Ulrich Faigle:
An algorithmic characterization of antimatroids. Discret. Appl. Math. 28(3): 197-205 (1990) - [c1]E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem. IPCO 1990: 85-100
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-04-25 05:57 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:
