Search Results - subject:"Polynomially solvable"

An exact solution with an improved running time for the routing flow shop problem with two machines

Chernykh, Ilya; Kononov, Alexander; Sevastyanov, Sergey - In: Journal of scheduling : JOS 27 (2024) 4, pp. 329-340

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

The rank-one quadratic assignment problem

Wang, Yang; Yang, Wei; Punnen, Abraham P.; Tian, Jingbo; … - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 979-996

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

A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

Khramova, Antonina P.; Chernykh, Ilya - In: Journal of scheduling : JOS 24 (2021) 4, pp. 405-412

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

The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications

Punnen, Abraham P. (ed.) - 2022

Polynomially Solvable Special Cases of QUBO -- The Boolean Quadric Polytope -- Autarkies and Persistencies for QUBO -- Mathematical … applications modelling, complexity and polynomially solvable special cases, exact and heuristic algorithms, analysis of …

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

Cell-and-bound algorithm for chance constrained programs with discrete distributions

Zheng, Xiaojin; Wu, Baiyi; Cui, Xueting - In: European journal of operational research : EJOR 260 (2017) 2, pp. 421-431

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

Pyramidal tours and multiple objectives

Özpeynirci, Özgür; Köksalan, Murat - In: Journal of Global Optimization 48 (2010) 4, pp. 569-582

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