Search Results - subject:"NP-hard problems"

Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review

Bentert, Matthias; Van Bevern, René; Niedermeier, Rolf - In: Journal of scheduling 22 (2019) 1, pp. 3-20

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

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

Yousefikhoshbakht, Majid; Khorram, Esmaile - In: Journal of Industrial Engineering International 8 (2012), pp. 1-9

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such...

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

An adaptive genetic algorithm for demand-driven and resource-constrained project scheduling in aircraft assembly

Shan, Siqing; Hu, Zhongjun; Liu, Zhilian; Shi, Jihong; … - In: Information technology and management 18 (2017) 1, pp. 41-53

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

Solutions to quadratic minimization problems with box and integer constraints

Gao, David; Ruan, Ning - In: Journal of Global Optimization 47 (2010) 3, pp. 463-484

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

Route planning for agent-based information retrieval

Sygkouna, Irene; Drakos, Marios-Polychronis; … - In: Computational Optimization and Applications 47 (2010) 1, pp. 77-96

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