Search Results - subject:"Exact algorithm"

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

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

Solving the Minimum Independent Domination Set problem in graphs by exact algorithm and greedy heuristic

Laforest, Christian; Phan, Raksmey - In: RAIRO 47 (2013) 3, pp. 199-221

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

Critical edges for the assignment problem : complexity and exact resolution

Bazgan, Cristina; Toubaline, Sonia; Vanderpooten, Daniel - In: Operations research letters 41 (2013) 6, pp. 685-689

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

Bin covering with a general profit function : approximability results

Benkő, Attila; Dósa, György; Tuza, Zsolt - In: Central European journal of operations research : CEJOR … 21 (2013) 4, pp. 805-816

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

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

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

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Mavrotas, George; Figueira, José; Antoniadis, Alexandros - In: Journal of Global Optimization 49 (2011) 4, pp. 589-606

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

An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs

Özpeynirci, Özgür; Köksalan, Murat - In: Management Science 56 (2010) 12, pp. 2302-2315

In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed …

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

Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees

Fuchs, Bernhard; Kern, Walter; Wang, Xinhui - In: Mathematical Methods of Operations Research 66 (2007) 1, pp. 117-125

The Dreyfus–Wagner algorithm is a well-known dynamic programming method for computing minimum Steiner trees in general weighted graphs in time O <Superscript>*</Superscript>(3<Superscript> k </Superscript>), where k is the number of terminal nodes to be connected. We improve its running time to O <Superscript>*</Superscript>(2.684<Superscript> k </Superscript>) by showing that the optimum Steiner...</superscript></superscript></superscript></superscript>

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