Zobrazeno 1 - 10 of 15 pro vyhledávání: '"Richard J. Forrester"'
1
Akademický článek
Computational Comparison of Exact Solution Methods for 0-1 Quadratic Programs: Recommendations for Practitioners
Autor: Richard J. Forrester, Noah Hunt-Isaak
Publikováno v: Journal of Applied Mathematics, Vol 2020 (2020)
This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied classes of nonlinear integer optimization problems because of their wide variety of applications. While a number of different solution approaches hav
Externí odkaz: https://doaj.org/article/6a3650432c544e3dba7f4091cbdfe04c
Zobrazit plný text záznamu
2
Akademický článek
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Autor: Elizabeth L. Bouzarth, Richard J. Forrester, Kevin R. Hutson, Rahul Isaac, James Midkiff, Danny Rivers, Leonard J. Testa
Publikováno v: Journal of Applied Mathematics, Vol 2018 (2018)
The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear program
Externí odkaz: https://doaj.org/article/22bee1cf29ba4a6aa26209dc0c8a86b8
Zobrazit plný text záznamu
7
Assigning students to schools to minimize both transportation costs and socioeconomic variation between schools
Autor: Lattie Reddoch, Kevin R. Hutson, Elizabeth L. Bouzarth, Richard J. Forrester
Publikováno v: Socio-Economic Planning Sciences. 64:1-8
Several studies have found that students' academic achievement is as much determined by the socioeconomic composition of their school as their own socioeconomic status. In this paper we provide a methodology for assigning students to schools so as to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::72d32fb0ffa635dce7f18e54304750f2
https://doi.org/10.1016/j.seps.2017.09.001
Zobrazit plný text záznamu
8
Tightening concise linear reformulations of 0-1 cubic programs
Autor: Richard J. Forrester
Publikováno v: Optimization. 65:877-903
A common strategy for solving 0-1 cubic programs is to reformulate the non-linear problem into an equivalent linear representation, which can then be submitted directly to a standard mixed-integer programming solver. Both the size and the strength of
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5bc51098ca52ef54bb2ca80297cab2a5
https://doi.org/10.1080/02331934.2015.1091821
Zobrazit plný text záznamu
9
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Autor: Rahul Isaac, Kevin R. Hutson, James Midkiff, Danny Rivers, Elizabeth L. Bouzarth, Leonard J. Testa, Richard J. Forrester
Publikováno v: J. Appl. Math.
Journal of Applied Mathematics, Vol 2018 (2018)
The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear program
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce244e5c770426b2ea7c1404f6c44cea
Zobrazit plný text záznamu
10
Balancing Faculty and Student Preferences in the Assignment of Students to Groups
Autor: Richard J. Forrester, Kevin R. Hutson
Publikováno v: Decision Sciences Journal of Innovative Education. 12:131-147
This article describes a practical methodology for assigning students to groups where the goal is to create diversity within the groups while taking into consideration the preferences of the students. A motivating application of this work is the assi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::55edda37ea3ee30c414ac0fecab5da3d
https://doi.org/10.1111/dsji.12029
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje