Zobrazeno 1 - 10
of 28
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8603987a5711b48e8a813a18c905e697
https://doi.org/10.1287/inte.2022.1139
https://doi.org/10.1287/inte.2022.1139
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d122d6a106aed4bc355959df3f7a8ae1
https://doi.org/10.1287/ijoc.1110.0450
https://doi.org/10.1287/ijoc.1110.0450
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33e738e608894ca7aab245c647646f95
https://doi.org/10.1287/ijoc.1090.0347
https://doi.org/10.1287/ijoc.1090.0347
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a90b65a660309323d537e7e43306c271
https://doi.org/10.1007/s10479-006-0058-z
https://doi.org/10.1007/s10479-006-0058-z
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e11156a41f7a328486ad3556dd09a12
https://doi.org/10.1023/b:supe.0000020179.55383.ad
https://doi.org/10.1023/b:supe.0000020179.55383.ad
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8246579a14c9eb70f1b7860d7c83c6c8
https://doi.org/10.1007/s10107-003-0404-8
https://doi.org/10.1007/s10107-003-0404-8
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba9ab80d0ca6329e0d49fffcb65aafc5
https://doi.org/10.1016/s0268-0033(01)00037-7
https://doi.org/10.1016/s0268-0033(01)00037-7
Autor:
Matthew J. Saltzman, Robert E. Bixby
Publikováno v:
Operations Research Letters. 15:169-178
An important issue in the implementation of interior point algorithms for linear programming is the recovery of an optimal basic solution from an optimal interior point solution. In this paper we describe a method for recovering such a solution. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b3fd4b06d9416ff7374b078db01ef0
https://doi.org/10.1016/0167-6377(94)90074-4
https://doi.org/10.1016/0167-6377(94)90074-4