Similar Search Results

Approximation algorithms for solving the constrained arc routing problem in mixed graphs

Ding, Honglin; Li, Jianping; Lih, Ko-wei - In: European journal of operational research : EJOR 239 (2014) 1, pp. 80-88

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

Minimizing the number of switch instances on a flexible machine in polynomial time

Adjiashvili, David; Bosio, Sandro; Zemmer, Kevin - In: Operations research letters 43 (2015) 3, pp. 317-322

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

Evaluating performance of image segmentation criteria and techniques

Hochbaum, Dorit S.; Lyu, Cheng; Bertelli, Erik - In: EURO journal on computational optimization 1 (2013) 1/2, pp. 155-180

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

Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints

Gayon, Jean-Philippe; Massonnet, Guillaume; Rapine, … - In: Mathematics of operations research 42 (2017) 3, pp. 854-875

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

Addressing the multiplicity of optimal solutions to the Clonal Deconvolution and Evolution Problem

Tellaetxe-Abete, Maitena; Calvo, Borja - In: European journal of operational research : EJOR 320 (2025) 3, pp. 777-788

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

The Hierarchical Chinese Postman Problem : the slightest disorder makes it hard, yet disconnectedness is manageable

Afanasev, Vsevolod A.; Bevern, René van; Tsidulko, Oxana - In: Operations research letters 49 (2021) 2, pp. 270-277

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

A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music

Balliauw, Matteo; Herremans, Dorien; Palhazi Cuervo, Daniel - In: International transactions in operational research : … 24 (2017) 3, pp. 509-535

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

Contributions to exact approaches in combinatorial optimization

Gschwind, Timo - 2014

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the...

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

A decomposition based solution algorithm for u-type assembly line balancing with interval data

Hazır, Öncü; Dolgui, Alexandre - In: Computers & operations research : and their … 59 (2015), pp. 126-131

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

Achieving domain consistency and counting solutions for dispersion constraints

Pesant, Gilles - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 690-703

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

1
2
3
4
5
6
7
8
9
10
Next
Last