Publication | Closed Access

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

Mathematical ProgrammingOrder TheoryEngineeringSequential Ordering ProblemPrecedence RelationshipsSorting AlgorithmSequential AlgorithmLagrangian Relax-and-cut ApproachAlgorithmic EfficiencyComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationOperations Research