Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Matthew J. Saltzman"'
Autor:
Amy B. Gore, Mary E. Kurz, Matthew J. Saltzman, Blake Splitter, William C. Bridges, Neil J. Calkin
Publikováno v:
INFORMS Journal on Applied Analytics. 52:553-567
The COVID-19 pandemic forced universities to upend their class scheduling. At Clemson University, the administration implemented hybrid schedules for fall 2020, in which students attend classes partly online and partly in person. To limit exposures o
Autor:
Matthew J. Saltzman
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783030564285
Creating and understanding optimization models, instances, and solutions of any significant size present a serious challenge, even to experts in the field. Greenberg pursued an initiative in the 1980s and 1990s to support research and development of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd3b5b922e1f92b525e328b5d230ae04
https://doi.org/10.1007/978-3-030-56429-2_3
https://doi.org/10.1007/978-3-030-56429-2_3
Publikováno v:
INFORMS Journal on Computing. 24:202-209
We apply the level-3 reformulation-linearization technique (RLT3) to the quadratic assignment problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm based on this RLT3 formulation. Our method is n
Publikováno v:
INFORMS Journal on Computing. 21:383-397
In this paper, we discuss the challenges that arise in parallelizing algorithms for solving generic mixed integer linear programs and introduce a software framework that aims to address these challenges. Although the framework makes few algorithmic a
Publikováno v:
Annals of Operations Research. 147:43-70
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions a
Publikováno v:
The Journal of Supercomputing. 28:215-234
This paper describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data-intensive algorithms, in which large am
Publikováno v:
Mathematical Programming. 98:253-280
In discrete optimization, most exact solution approaches are based on branch and bound, which is conceptually easy to parallelize in its simplest forms. More sophisticated variants, such as the so-called branch, cut, and price algorithms, are more di
Publikováno v:
Clinical Biomechanics. 16:489-495
Objective. A mathematical model of the temporomandibular joint was developed to study the magnitude and direction of the compressive loading experienced at the temporomandibular joint during clenching. Design. The model was based on the principles of
Autor:
Matthew J. Saltzman, Kevin S. McCurley
Publikováno v:
ORSA Journal on Computing. 2:365-368
Review of: Nielsen, Jakob (ed.) (1989) Coordinating User Interfaces for Consistency, Academic Press, San Diego, CA. Reviewed by: Matthew J. Saltzman. Review of: Wolfram, Stephen (1988) Mathematica: A System for Doing Mathematics by Computer, Addison