The unit-capacity constrained permutation problem

DOI10.1016/j.ejor.2018.01.049zbMath1403.90561OpenAlexW2792223441MaRDI QIDQ1754340

Pierre Fouilhoux, Pascale Bendotti, Safia Kedad-Sidhoum

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.049

zbMATH Keywords

dynamic programmingcombinatorial optimizationcomplexity theoryOR in energydominance and symmetry properties

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items

Feasibility recovery for the unit-capacity constrained permutation problem

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• An algorithmic analysis of the Honey-Bee game
• The shortest common supersequence problem over binary alphabet is NP- complete
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• On the complexity of loop fusion
• Feasibility recovery for 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
• A branch-and-cut algorithm for the preemptive swapping problem
• The preemptive swapping problem on a tree
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• The swapping problem
• The Complexity of Some Problems on Subsequences and Supersequences
• The General Pickup and Delivery Problem
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem