The unit-capacity constrained permutation problem

DOI10.1016/J.EJOR.2018.01.049zbMATH Open1403.90561OpenAlexW2792223441MaRDI QIDQ1754340FDOQ1754340

Authors: Pascale Bendotti, Pierre Fouilhoux, S. 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

Recommendations

• Feasibility recovery for the unit-capacity constrained permutation problem
• Permutation Problems and Channelling Constraints
• Capacity of permutations
• A capacity allocation problem with integer side constraints
• On the question of the optimization of permutations in the problem with dynamic constraints
• On the \(m\)-capacitated peripatetic salesman problem with capacity restrictions
• The capacity constrained facility location problem
• Convex relaxations for permutation problems
• Convex solution of a permutation problem
• The undirected \(m\)-capacitated peripatetic salesman problem

zbMATH Keywords

combinatorial optimizationdynamic programmingcomplexity theoryOR in energydominance and symmetry properties

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A survey of scheduling problems with setup times or costs
• A branch-and-cut algorithm for the preemptive swapping problem
• The swapping problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• The General Pickup and Delivery Problem
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• The single vehicle routing problem with deliveries and selective pickups
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• The Complexity of Some Problems on Subsequences and Supersequences
• An algorithmic analysis of the Honey-Bee game
• The shortest common supersequence problem over binary alphabet is NP- complete
• The preemptive swapping problem on a tree
• On the complexity of loop fusion
• Feasibility recovery for the unit-capacity constrained permutation problem
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

Cited In (2)

• Feasibility recovery for the unit-capacity constrained permutation problem
• Permutation Problems and Channelling Constraints

This page was built for publication: The unit-capacity constrained permutation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754340)