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

Search the dblp DataBase

Title:
Author:
Dieter Vandenbussche: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche
    K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2003, v:15, n:4, pp:385-396 [Journal]
  2. 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]
  3. 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]
  4. 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]

Search in 0.002secs, Finished in 0.002secs
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