- 1
-
D. Applegate, R. Bixby, V. Chvátal, and W. Cook.
CONCORDE TSP solver.
http://www.tsp.gatech.edu/concorde.html.
- 2
-
D. Applegate, R. Bixby, V. Chvátal, and W. Cook.
On the solution of traveling salesman problems.
Documenta Mathematica, Extra Volume Proceedings ICM III
(1998):645-656, 1998.
- 3
-
E. Balas, S. Ceria, and G. Cornuéjols.
Mixed 0-1 programming by lift-and-project in a branch-and-cut
framework.
Management Science, 42:1229-1246, 1996.
- 4
-
M. Benchouche, V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol.
Building a parallel branch and bound library.
In in Solving Combinatorial Optimization Problems in Parallel,
Lecture Notes in Computer Science 1054, page 201. Springer, Berlin,
1996.
- 5
-
V. J. Bowman.
On the relationship of the Tchebycheff norm and the efficient
frontier of multiple-criteria objectives.
In H. Thieriez, editor, Multiple Criteria Decision Making,
pages 248-258. Springer, Berlin, 1976.
- 6
-
Q. Chen, M. C. Ferris, and J. T. Linderoth.
Fatcop 2.0: Advanced features in an opportunistic mixed integer
programming solver.
Annals of Operations Research, 103:17-32, 2001.
- 7
-
J. Climaco, C. Ferreira, and M.E. Captivo.
Multicriteria integer programming: an overview of different
algorithmic approaches.
In J. Climaco, editor, Multicriteria Analysis, pages 248-258.
Springer, Berlin, 1997.
- 8
-
C. Cordier, H. Marchand, R. Laundy, and L.A. Wolsey.
bc-opt: A branch-and-cut code for mixed integer programs.
Mathematical Programming, 86:335-353, 1999.
- 9
-
ILOG CPLEX Division.
http://www.cplex.com.
- 10
-
J. Eckstein, C.A. Phillips, and W.E. Hart.
PICO: An object-oriented framework for parallel branch and bound.
Technical Report RRR 40-2000, Rutgers University, 2000.
- 11
-
M. Ehrgott and X. Gandibleux.
A survey and annotated bibliography of multiobjective combinatorial
optimization.
OR Spektrum, 22:425-460, 2000.
- 12
-
M. Ehrgott and X. Gandibleux.
Multiobjective combinatorial optimization--theory, methodology and
applications.
In M. Ehrgott and X. Gandibleux, editors, Multiple Criteria
Optimization--State of the Art Annotated Bibliographic Surveys, pages
369-444. Kluwer Academic Publishers, Boston, MA, 2002.
- 13
-
M. Ehrgott and M.M. Wiecek.
Multiobjective programming.
In M. Ehrgott, J. Figueira, and S. Greco, editors, State of the
Art of Multiple Criteria Decision Analysis, Boston, MA, 2004. Kluwer
Academic Publishers.
- 14
-
P. K. Eswaran, A. Ravindran, and H. Moskowitz.
Algorithms for nonlinear integer bicriterion problems.
Journal of Optimization Theory and Applications,
63(2):261-279, 1989.
- 15
-
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam.
PVM: Parallel Virtual Machine.
The MIT Press, Cambridge, MA, 1994.
- 16
-
B. Gendron and T. G. Crainic.
Parallel branch and bound algorithms: Survey and synthesis.
Operations Research, 42:1042-1066, 1994.
- 17
-
A. M. Geoffrion.
Proper efficiency and the theory of vector maximization.
Journal of Mathematical Analysis and Applications, 22:618-630,
1968.
- 18
-
A.Y. Grama and V. Kumar.
State of the art in parallel search techniques for discrete
optimization problems.
IEEE Transactions on Knowledge and Data Engineering, 11:1-8,
1999.
- 19
-
M. Grötschel, M. Jünger, and G. Reinelt.
A cutting plane algorithm for the linear ordering problem.
Operations Research, 32(6):1195-1220, 1984.
- 20
-
K. Hoffman and M. Padberg.
LP-based combinatorial problem solving.
Annals of Operations Research, 4:145-194, 1985.
- 21
-
M. Jünger and S. Thienel.
The ABACUS system for branch and cut and price algorithms in
integer programming and combinatorial optimization.
Software Practice and Experience, 30:1325-1352, 2001.
- 22
-
V. Kumar and V. N. Rao.
Parallel depth-first search, part II: Analysis.
International Journal of Parallel Programming, 16:501-519,
1987.
- 23
-
J. Linderoth.
Topics in Parallel Integer Optimization.
PhD thesis, School of Industrial and Systems Engineering, Georgia
Institute of Technology, Atlanta, GA, 1998.
- 24
-
R. Lougee-Heimer.
The Common Optimization INterface for Operations Research.
IBM Journal of Research and Development, 47:57-66, 2003.
- 25
-
A. Makhorin.
Introduction to GLPK, 2004.
Available from
http://www.gnu.org/software/glpk/glpk.html.
- 26
-
A. Martin.
Integer programs with block structure.
Habilitation Thesis, Technical University of Berlin, Berlin, Germany,
1998.
- 27
-
G.L. Nemhauser, M.W.P. Savelsbergh, and G.S. Sigismondi.
MINTO, a Mixed INTeger Optimizer.
Operations Research Letters, 15:47-58, 1994.
- 28
-
G.L. Nemhauser and L.A. Wolsey.
Integer and Combinatorial Optimization.
Wiley, New York, 1988.
- 29
-
M. W. Padberg and G. Rinaldi.
A branch and cut algorithm for the solution of large scale traveling
salesman problems.
SIAM Review, 33:60-100, 1991.
- 30
-
T.K. Ralphs and L. Ladányi.
SYMPHONY Version 4.0 User's Manual, 2004.
http://www.brandandcut.org.
- 31
-
T.K. Ralphs, M.J. Saltzman, and M.M. Wiecek.
An improved algorithm for biobjective integer programming.
To appear in Annals of Operations Research, 2005.
- 32
-
V. N. Rao and V. Kumar.
Parallel depth-first search, part I: Implementation.
International Journal of Parallel Programming, 16:479-499,
1987.
- 33
-
Y. Shinano, K. Harada, and R. Hirabayashi.
A generalized utility for parallel branch and bound algorithms.
In Proceedings of the 1995 Seventh Symposium on Parallel and
Distributed Processing, pages 392-401, Los Alamitos, CA, 1995. IEEE
Computer Society Press.
- 34
-
R. Solanki.
Generating the noninferior set in mixed integer biobjective linear
programs: an application to a location problem.
Computers and Operations Research, 18:1-15, 1991.
- 35
-
S. Tschoke and T. Polzer.
Portable Parallel Branch and Bound Library User Manual: Library
Version 2.0.
Department of Computer Science, University of Paderborn.
- 36
-
Y. Xu, T.K. Ralphs, L. Ladányi, and M.J. Saltzman.
ALPS: A framework for implementing parallel search algorithms.
In Proceedings of the Ninth INFORMS Computing Society
Conference, pages 319-334, 2005.
Ted Ralphs
2008-10-21