default search action
Ellis L. Johnson
Ellis Lane Johnson
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
- award (2000): John von Neumann Theory Prize
- award (1983): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
- [j80]Senay Solak
, Gustaf Sölveling, John-Paul B. Clarke, Ellis L. Johnson:
Stochastic Runway Scheduling. Transp. Sci. 52(4): 917-940 (2018) - 2016
- [j79]Yu-Heng Chang, Senay Solak, John-Paul B. Clarke, Ellis L. Johnson:
Models for single-sector stochastic air traffic flow management under reduced airspace capacity. J. Oper. Res. Soc. 67(1): 54-67 (2016) - 2013
- [j78]Sangho Shim, Ellis L. Johnson:
Cyclic group blocking polyhedra. Math. Program. 138(1-2): 273-307 (2013) - [j77]Yan Shu, Sunil Chopra
Binary group facets with complete support and non-binary coefficients. Oper. Res. Lett. 41(6): 679-684 (2013) - [j76]Andreea Popescu
Bid Prices When Demand Is a Mix of Individual and Batch Bookings. Transp. Sci. 47(2): 198-213 (2013) - 2012
- [j75]Jon D. Petersen, Gustaf Sölveling, John-Paul Clarke, Ellis L. Johnson, Sergey Shebalov:
An Optimization Approach to Airline Integrated Recovery. Transp. Sci. 46(4): 482-500 (2012) - 2011
- [j74]Balaji Gopalakrishnan, Seunghyun Kong, Earl R. Barnes, Ellis L. Johnson, Joel S. Sokol
A least-squares minimum-cost network flow algorithm. Ann. Oper. Res. 186(1): 119-140 (2011) - [j73]Zhe Liang, Wanpracha Art Chaovalitwongse, Huei Chuen Huang, Ellis L. Johnson:
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem. Transp. Sci. 45(1): 109-120 (2011) - 2010
- [j72]Sangho Shim, Ellis L. Johnson, Wenwei Cao:
Primal-dual simplex method for shooting. Electron. Notes Discret. Math. 36: 719-726 (2010) - [j71]Senay Solak, John-Paul Clarke, Ellis L. Johnson, Earl R. Barnes:
Optimization of R&D project portfolios under endogenous uncertainty. Eur. J. Oper. Res. 207(1): 420-433 (2010) - [j70]Adan Vela, Senay Solak, John-Paul Clarke, William E. Singhose, Earl R. Barnes, Ellis L. Johnson:
Near Real-Time Fuel-Optimal En Route Conflict Resolution. IEEE Trans. Intell. Transp. Syst. 11(4): 826-837 (2010) - [c8]Steve Tyber, Ellis L. Johnson:
A Polyhedral Study of the Mixed Integer Cut. IPCO 2010: 124-134
2000 – 2009
- 2009
- [j69]Chunhua Gao, Ellis L. Johnson, Barry C. Smith:
Integrated Airline Fleet and Crew Robust Planning. Transp. Sci. 43(1): 2-16 (2009) - 2008
- [j68]Brady Hunsaker
Polarity and the complexity of the shooting experiment. Discret. Optim. 5(2): 541-549 (2008) - [j67]Yufeng Yao, Özlem Ergun, Ellis L. Johnson, William Schultz, J. M. Singleton:
Strategic planning in fractional aircraft ownership programs. Eur. J. Oper. Res. 189(2): 526-539 (2008) - [j66]Timothy L. Jacobs, Barry C. Smith, Ellis L. Johnson:
Incorporating Network Flow Effects into the Airline Fleet Assignment Process. Transp. Sci. 42(4): 514-529 (2008) - 2007
- [c7]Senay Solak, John-Paul Clarke, Ellis L. Johnson, Earl R. Barnes:
A Stochastic Programming Model with Decision Dependent Uncertainty Realizations for Technology Portfolio Management. OR 2007: 75-80 - [c6]Liling Ren
Simulating air traffic blockage due to convective weather conditions. WSC 2007: 1897-1904 - 2006
- [j65]Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, George L. Nemhauser, Joel S. Sokol
Short-term booking of air cargo space. Eur. J. Oper. Res. 174(3): 1979-1990 (2006) - [j64]Andreea Popescu
Estimating Air-Cargo Overbooking Based on a Discrete Show-Up-Rate Distribution. Interfaces 36(3): 248-258 (2006) - [j63]Milind G. Sohoni
Operational airline reserve crew planning. J. Sched. 9(3): 203-221 (2006) - [j62]Barry C. Smith, Ellis L. Johnson:
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition. Transp. Sci. 40(4): 497-516 (2006) - 2005
- [j61]Monique Guignard, Ellis L. Johnson, Kurt Spielberg:
Logical Processing for Integer Programming. Ann. Oper. Res. 140(1): 263-304 (2005) - [j60]Balaji Gopalakrishnan, Ellis L. Johnson:
Airline Crew Scheduling: State-of-the-Art. Ann. Oper. Res. 140(1): 305-337 (2005) - [j59]Andrew J. Schaefer
Airline Crew Scheduling Under Uncertainty. Transp. Sci. 39(3): 340-348 (2005) - [j58]I-Lin Wang
A Multiple Pairs Shortest Path Algorithm. Transp. Sci. 39(4): 465-476 (2005) - [c5]Ellis L. Johnson:
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition. AAIM 2005: 1-2 - 2004
- [j57]Jeffery D. Weir
A Three-Phase Approach to Solving the Bidline Problem. Ann. Oper. Res. 127(1-4): 283-308 (2004) - [j56]Milind G. Sohoni
Long-Range Reserve Crew Manpower Planning. Manag. Sci. 50(6): 724-739 (2004) - [j55]Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser:
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles. Transp. Sci. 38(3): 357-368 (2004) - 2003
- [j54]Milind G. Sohoni, T. Glenn Bailey, Kristi G. Martin, Helen Carter, Ellis L. Johnson:
Special Section: Wagner Prize Papers: Delta Optimizes Continuing-Qualification-Training Schedules for Pilots. Interfaces 33(5): 57-70 (2003) - [j53]Ralph E. Gomory, Ellis L. Johnson:
An approach to integer programming. Math. Program. 96(2): 181-181 (2003) - [j52]Ralph E. Gomory, Ellis L. Johnson, Lisa Evans:
Corner Polyhedra and their connection with cutting planes. Math. Program. 96(2): 321-339 (2003) - [j51]Ralph E. Gomory, Ellis L. Johnson:
T-space and cutting planes. Math. Program. 96(2): 341-375 (2003) - [j50]Julián Aráoz, Lisa Evans, Ralph E. Gomory, Ellis L. Johnson:
Cyclic group and knapsack facets. Math. Program. 96(2): 377-408 (2003) - [j49]Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser:
Rerouting Aircraft for Airline Recovery. Transp. Sci. 37(4): 408-421 (2003) - [c4]Loo Hay Lee, Huei Chuen Huang, Chulung Lee, Ek Peng Chew, Wikrom Jaruphongsa, Yean Yik Yong, Zhe Liang, Chun How Leong, Yen Ping Tan, Kalyan Namburi, Ellis L. Johnson, Jerry Banks:
Simulation of airports/aviation systems: discrete event simulation model for airline operations: SIMAIR. WSC 2003: 1656-1662 - 2002
- [j48]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Facets of the Complementarity Knapsack Polytope. Math. Oper. Res. 27(1): 210-226 (2002) - [j47]Hamish Waterer, Ellis L. Johnson, Paolo Nobili
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program. 93(3): 477-494 (2002) - [j46]Earl R. Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson:
A least-squares primal-dual algorithm for solving linear programming problems. Oper. Res. Lett. 30(5): 289-294 (2002) - [j45]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Airline Crew Scheduling with Time Windows and Plane-Count Constraints. Transp. Sci. 36(3): 337-348 (2002) - [j44]Jay M. Rosenberger, Andrew J. Schaefer
A Stochastic Model of Airline Operations. Transp. Sci. 36(4): 357-377 (2002) - 2001
- [j43]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching. Comput. Optim. Appl. 20(1): 73-91 (2001) - [j42]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16(1): 25-39 (2001) - [j41]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Airline Crew Scheduling with Regularity. Transp. Sci. 35(4): 359-374 (2001) - [c3]Jack Edmonds, Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs. Combinatorial Optimization 2001: 27-30 - 2000
- [j40]Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS J. Comput. 12(1): 2-23 (2000) - [j39]Alper Atamtürk, Ellis L. Johnson, Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Relational Modeling System for Linear and Integer Programming. Oper. Res. 48(6): 846-857 (2000) - [j38]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89(1): 187-203 (2000) - [j37]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser:
A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2): 47-55 (2000) - [j36]Ladislav Lettovsky, Ellis L. Johnson, George L. Nemhauser:
Airline Crew Recovery. Transp. Sci. 34(4): 337-348 (2000) - [c2]Jay M. Rosenberger, Andrew J. Schaefer
Air transportation simulation: SimAir: a stochastic model of airline operations. WSC 2000: 1118-1122
1990 – 1999
- 1999
- [j35]Jing Hu, Ellis L. Johnson:
Computational results with a primal-dual subproblem simplex method. Oper. Res. Lett. 25(4): 149-157 (1999) - 1998
- [j34]Cynthia Barnhart
Branch-and-Price: Column Generation for Solving Huge Integer Programs. Oper. Res. 46(3): 316-329 (1998) - [j33]Cynthia Barnhart
Flight String Models for Aircraft Fleeting and Routing. Transp. Sci. 32(3): 208-220 (1998) - 1997
- [j32]Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Zhongxi Zhu:
The aircraft rotation problem. Ann. Oper. Res. 69: 33-46 (1997) - [j31]Pamela H. Vance, Cynthia Barnhart
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm. Oper. Res. 45(2): 188-200 (1997) - 1996
- [j30]Lloyd W. Clarke, Christopher A. Hane, Ellis L. Johnson, George L. Nemhauser:
Maintenance and Crew Considerations in Fleet Assignment. Transp. Sci. 30(3): 249-260 (1996) - 1995
- [j29]Cynthia Barnhart, Levent Hatay, Ellis L. Johnson:
Deadhead Selection for the Long-Haul Crew Pairing Problem. Oper. Res. 43(3): 491-499 (1995) - [j28]Christopher A. Hane, Cynthia Barnhart
The fleet assignment problem: Solving a large-scale integer program. Math. Program. 70: 211-232 (1995) - 1994
- [j27]Pamela H. Vance, Cynthia Barnhart
Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3(2): 111-130 (1994) - [j26]Zonghao Gu, Ellis L. Johnson, George L. Nemhauser, Wang Yinhua:
Some properties of the fleet assignment problem. Oper. Res. Lett. 15(2): 59-71 (1994) - [j25]Cynthia Barnhart
A column generation and partitioning approach for multi-commodity flow problems. Telecommun. Syst. 3(3): 239-258 (1994) - 1993
- [j24]Cynthia Barnhart
Formulating a Mixed Integer Programming Problem to Improve Solvability. Oper. Res. 41(6): 1013-1019 (1993) - [j23]Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser:
Min-cut clustering. Math. Program. 62: 133-151 (1993) - 1992
- [j22]Ranga Anbil, Rajan Tanga, Ellis L. Johnson:
A Global Approach to Crew-Pairing Optimization. IBM Syst. J. 31(1): 71-78 (1992) - [j21]Ellis L. Johnson, George L. Nemhauser:
Recent Developments and Future Directions in Mathematical Programming. IBM Syst. J. 31(1): 79-93 (1992)
1980 – 1989
- 1989
- [j20]Sunil Chopra
Polyhedra of regularp-nary group problems. Math. Program. 43(1-3): 1-29 (1989) - [j19]Huiling Gan, Ellis L. Johnson:
Four problems on graphs with excluded minors. Math. Program. 45(1-3): 311-330 (1989) - 1987
- [j18]Sunil Chopra
Dual row modules and polyhedra of blocking group problems. Math. Program. 38(3): 229-270 (1987) - 1986
- [j17]Gilles Gastou, Ellis L. Johnson:
Binary group and Chinese postman polyhedra. Math. Program. 34(1): 1-33 (1986) - 1985
- [j16]Ellis L. Johnson, Michael M. Kostreva, Uwe H. Suhl:
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models. Oper. Res. 33(4): 803-819 (1985) - 1984
- [j15]Michael Held, Alan J. Hoffman, Ellis Lane Johnson, Philip Wolfe:
Aspects of the Traveling Salesman Problem. IBM J. Res. Dev. 28(4): 476-486 (1984) - 1983
- [j14]Harlan P. Crowder, Ellis L. Johnson, Manfred W. Padberg:
Solving Large-Scale Zero-One Linear Programming Problems. Oper. Res. 31(5): 803-834 (1983) - [j13]D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets. Math. Oper. Res. 8(4): 579-589 (1983) - 1982
- [j12]Daniel Granot, Frieda Granot, Ellis L. Johnson:
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. Math. Oper. Res. 7(4): 545-556 (1982) - [j11]Achim Bachem, Ellis L. Johnson, Rainer Schrader:
A characterization of minimal valid inequalities for mixed integer programs. Oper. Res. Lett. 1(2): 63-66 (1982) - 1981
- [j10]Ellis L. Johnson:
On the Generality of the Subadditive Characterization of Facets. Math. Oper. Res. 6(1): 101-112 (1981) - [j9]Ellis L. Johnson, Manfred W. Padberg:
A note of the knapsack problem with special ordered sets. Oper. Res. Lett. 1(1): 18-22 (1981) - 1980
- [j8]Ellis L. Johnson, Uwe H. Suhl:
Experiments in integer programming. Discret. Appl. Math. 2(1): 39-55 (1980) - [j7]Ellis L. Johnson:
Subadditive Lifting Methods for Partitioning and Knapsack Problems. J. Algorithms 1(1): 75-96 (1980)
1970 – 1979
- 1978
- [j6]Richard L. Chen, Harlan P. Crowder, Ellis L. Johnson:
Solving the Installation Scheduling Problem Using Mixed Integer Linear Programming. IBM Syst. J. 17(1): 82-91 (1978) - 1975
- [j5]Peter L. Hammer, Ellis L. Johnson, Uri N. Peled:
Facet of regular 0-1 polytopes. Math. Program. 8(1): 179-206 (1975) - 1973
- [j4]Jack Edmonds, Ellis L. Johnson:
Matching, Euler tours and the Chinese postman. Math. Program. 5(1): 88-124 (1973) - 1972
- [j3]Ralph E. Gomory, Ellis L. Johnson:
Some continuous functions related to corner polyhedra. Math. Program. 3(1): 23-85 (1972) - [j2]Ralph E. Gomory, Ellis L. Johnson:
Some continuous functions related to corner polyhedra, II. Math. Program. 3(1): 359-389 (1972) - [c1]Ellis L. Johnson:
On shortest paths and sorting. ACM Annual Conference (1) 1972: 510-517
1960 – 1969
- 1966
- [j1]Ellis L. Johnson:
Networks and Basic Solutions. Oper. Res. 14(4): 619-623 (1966)
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-10-07 21:20 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: