Search Results - subject:"exact algorithm"

An exact polynomial time algorithm for computing the least trimmed squares estimate

Klouda, Karel - In: Computational Statistics & Data Analysis 84 (2015) C, pp. 27-40

An exact algorithm for computing the estimates of regression coefficients given by the least trimmed squares method is …

Persistent link: https://www.econbiz.de/10011191035

An exact algorithm for the multiple-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport

Tang, Jiafu; Yu, Yang; Li, Jia - In: Transportation research / E : an international journal 73 (2015), pp. 114-132

Persistent link: https://www.econbiz.de/10010484871

Solving the maximum clique and vertex coloring problems on very large sparse networks

Verma, Anurag; Buchanan, Austin; Butenko, Sergiy - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 164-177

Persistent link: https://www.econbiz.de/10010505031

A DSATUR-based algorithm for the Equitable Coloring Problem

Méndez-Díaz, Isabel; Nasini, Graciela; Severín, Daniel - In: Computers & operations research : and their … 57 (2015), pp. 41-50

Persistent link: https://www.econbiz.de/10010495414

When polynomial approximation meets exact computation

Paschos, Vangelis Th. - In: 4OR : a quarterly journal of operations research 13 (2015) 3, pp. 227-245

Persistent link: https://www.econbiz.de/10011347901

On the implementation of LIR: the case of simple linear regression with interval data

Cattaneo, Marco; Wiencierz, Andrea - In: Computational Statistics 29 (2014) 3, pp. 743-767

union of finitely many polygons. We give an exact algorithm for determining this set (i.e., for determining the set … stretchy="false">)</mo> </mrow> </math> </EquationSource> </InlineEquation>. We have implemented this exact algorithm as part …

Persistent link: https://www.econbiz.de/10010998537

Exact formulations and algorithm for the train timetabling problem with dynamic demand

Barrena, Eva; Canca, David; Coelho, Leandro C.; … - In: Computers & operations research : and their … 44 (2014), pp. 66-74

Persistent link: https://www.econbiz.de/10010240597

Combinatorial Benders' cuts for the strip packing problem

Côté, Jean-François; Dell'Amico, Mauro; Iori, Manuel - In: Operations research 62 (2014) 3, pp. 643-661

Persistent link: https://www.econbiz.de/10010381845

Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree

Xu, Liang; Xu, Zhou; Xu, Dongsheng - In: European Journal of Operational Research 227 (2013) 2, pp. 284-292

minimized. The problem is known to be NP-hard even when k=2. In this paper, we have developed a pseudo-polynomial time exact … algorithm for this problem with any constant k⩾2, closing a question that has remained open for a decade. Along with this, we …

Persistent link: https://www.econbiz.de/10011052412

An exact algorithm for the precedence-constrained single-machine scheduling problem

Tanaka, Shunji; Sato, Shun - In: European Journal of Operational Research 229 (2013) 2, pp. 345-352

This study proposes an efficient exact algorithm for the precedence-constrained single-machine scheduling problem to …

Persistent link: https://www.econbiz.de/10010666096