The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
George L. Nemhauser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
    A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:158-170 [Conf]
  2. Kelly Easton, George L. Nemhauser, Michael A. Trick
    The Traveling Tournament Problem Description and Benchmarks. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:580-584 [Conf]
  3. George L. Nemhauser
    Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). [Citation Graph (0, 0)][DBLP]
    CP, 1996, pp:570- [Conf]
  4. Ismael R. de Farias Jr., George L. Nemhauser
    A Polyhedral Study of the Cardinality Constrained Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:291-303 [Conf]
  5. Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
    Valid Inequalities for Problems with Additive Variable Upper Bounds. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:60-72 [Conf]
  6. Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
    Sequence Independent Lifting of Cover Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:452-461 [Conf]
  7. Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
    Sequential Pairing of Mixed Integer Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:23-34 [Conf]
  8. Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
    Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:318-332 [Conf]
  9. Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
    Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:161-175 [Conf]
  10. Kelly Easton, George L. Nemhauser, Michael A. Trick
    Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. [Citation Graph (0, 0)][DBLP]
    PATAT, 2002, pp:100-112 [Conf]
  11. Jay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser
    Air transportation simulation: SimAir: a stochastic model of airline operations. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2000, pp:1118-1122 [Conf]
  12. Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
    Analysis of bounds for a capacitated single-item lot-sizing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:6, pp:1721-1743 [Journal]
  13. Dasong Cao, George L. Nemhauser
    Polyhedral Characterizations, Perfection of Line Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:141-154 [Journal]
  14. Jeff Day, George L. Nemhauser, Joel S. Sokol
    Management of Railroad Impedances for Shortest Path-based Routing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
  15. Ellis L. Johnson, George L. Nemhauser
    Recent Developments and Future Directions in Mathematical Programming. [Citation Graph (0, 0)][DBLP]
    IBM Systems Journal, 1992, v:31, n:1, pp:79-93 [Journal]
  16. Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh
    Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:2-23 [Journal]
  17. Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
    Sequence Independent Lifting in Mixed Integer Programming. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:1, pp:109-129 [Journal]
  18. Dieter Vandenbussche, George L. Nemhauser
    The 2-Edge-Connected Subgraph Polyhedron. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:4, pp:357-379 [Journal]
  19. Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
    Facets of the Complementarity Knapsack Polytope. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:1, pp:210-226 [Journal]
  20. Diego Klabjan, George L. Nemhauser
    A Polyhedral Study of Integer Variable Upper Bounds. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:4, pp:711-739 [Journal]
  21. Ismael R. de Farias Jr., George L. Nemhauser
    A polyhedral study of the cardinality constrained knapsack problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:96, n:3, pp:439-467 [Journal]
  22. Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller
    A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:1, pp:55-84 [Journal]
  23. Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser
    Min-cut clustering. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:133-151 [Journal]
  24. Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
    A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:95, n:1, pp:71-90 [Journal]
  25. George L. Nemhauser, Laurence A. Wolsey
    A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:379-390 [Journal]
  26. Dieter Vandenbussche, George L. Nemhauser
    A polyhedral study of nonconvex quadratic programs with box constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:3, pp:531-557 [Journal]
  27. Dieter Vandenbussche, George L. Nemhauser
    A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:3, pp:559-575 [Journal]
  28. Ismael R. de Farias Jr., George L. Nemhauser
    A family of inequalities for the generalized assignment polytope. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:49-55 [Journal]
  29. Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser
    On formulations of the stochastic uncapacitated lot-sizing problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:241-250 [Journal]
  30. Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
    Models for representing piecewise linear cost functions. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:44-48 [Journal]
  31. Diego Klabjan, Ellis L. Johnson, George L. Nemhauser
    A parallel primal-dual simplex algorithm. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:2, pp:47-55 [Journal]
  32. Diego Klabjan, George L. Nemhauser, C. Tovey
    The complexity of cover inequality separation. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:1-2, pp:35-40 [Journal]
  33. Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, George L. Nemhauser, Joel S. Sokol, Chun How Leong
    Short-term booking of air cargo space. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:3, pp:1979-1990 [Journal]
  34. James Luedtke, Shabbir Ahmed, George L. Nemhauser
    An Integer Programming Approach for Linear Programs with Probabilistic Constraints. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:410-423 [Conf]
  35. Wen-Lian Hsu, George L. Nemhauser
    Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:181-191 [Journal]
  36. Wen-Lian Hsu, George L. Nemhauser
    A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:1, pp:65-71 [Journal]

  37. Automated Channel Abstraction for Advertising Auctions. [Citation Graph (, )][DBLP]


  38. Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.302secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002