( en | de | ru )

 

Disambiguation of "Gordon, Valery S."

Author of the publication

copydeleteadd this publication to your clipboard
Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices.

, , and . J. Math. Model. Algorithms, 5 (2): 167-187 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Valery Makhavikou

Valéry Schmid

Valery Kardanov

Valery Radchenko

Valery Stojanow

 

Other publications of authors with the same name

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment., and . Comput. Oper. Res., 26 (2): 157-177 (1999)Scheduling with due date assignment under special conditions on job processing., , and . J. Sched., 15 (4): 447-456 (2012)Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals., , and . RAIRO Oper. Res., 35 (1): 71-83 (2001)Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs., and . Inf. Process. Lett., 68 (3): 153-159 (1998)On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints., , , and . Electron. Notes Discret. Math., (2007)On the inapproximability of independent domination in 2P3-free perfect graphs., , and . Theor. Comput. Sci., 410 (8-10): 977-982 (2009)Hamiltonian properties of locally connected graphs with bounded vertex degree., , , and . Discret. Appl. Math., 159 (16): 1759-1774 (2011)Guest Editorial - Discrete Optimization Methods in Production and Logistics., , , and . J. Math. Model. Algorithms, 5 (2): 139-141 (2006)Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices., , and . J. Math. Model. Algorithms, 5 (2): 167-187 (2006)Single machine scheduling with precedence constraints and positionally dependent processing times., , and . Comput. Oper. Res., 39 (6): 1218-1224 (2012)