Feasibility recovery for the unit-capacity constrained permutation problem

DOI10.1016/j.disopt.2015.09.004zbMath1387.90207OpenAlexW2187422511MaRDI QIDQ1751174

Pierre Fouilhoux, Pascale Bendotti

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.004

zbMATH Keywords

integer linear programmingdiscrete location and assignmentshortest common supersequencevertex-disjoint path cover

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

The unit-capacity constrained permutation problem

Cites Work

• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• The shortest common supersequence problem over binary alphabet is NP- complete
• Geometric algorithms and combinatorial optimization
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• The unit-capacity constrained permutation problem
• A survey of scheduling problems with setup times or costs
• The single vehicle routing problem with deliveries and selective pickups
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• The swapping problem
• The Complexity of Some Problems on Subsequences and Supersequences
• The General Pickup and Delivery Problem

This page was built for publication: Feasibility recovery for the unit-capacity constrained permutation problem