On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.124, Iss.1-4, 2003-01, pp. : 111-131

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Improved Lower Bounds for the Quadratic Assignment Problem

By Sergeev S. I.

Automation and Remote Control, Vol. 65, Iss. 11, 2004-11 ,pp. : 1733-1746

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Resolution-based lower bounds in MaxSAT

By Li Chu

Constraints, Vol. 15, Iss. 4, 2010-10 ,pp. : 456-484

Springer Publishing Company

Access to resources Recommend Favorite

One Machine Scheduling Problem with Fuzzy Random Due-Dates

By Itoh Takeshi Ishii Hiroaki

Fuzzy Optimization and Decision Making, Vol. 4, Iss. 1, 2005-02 ,pp. : 71-78

Springer Publishing Company

Access to resources Recommend Favorite

Upper and lower bounds for the two-level simple plant location problem

By Chardaire P. Lutton J. Sutter A.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 117-140

Springer Publishing Company

Access to resources Recommend Favorite

Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines

By La Poutre H.

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 87-99

Academic Press

Access to resources Recommend Favorite