Solvability of k-track assignment problem: a graph approach

DOI10.7641/CTA.2017.16033MaRDI QIDQ3131317zbMATH OpenFDO

Authors Jumei Yue, Y. Y. Yan, Xin Jin, Zengqiang Chen

Publication date 29 January 2018

Full work available at URL https://doi.org/10.7641/CTA.2017.16033

zbMATH Keywords

\(k\)-internally stable set\(k\)-track assignmentgraph methodsemi-tensor product of matricessolvability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• The k-Track assignment problem on partial orders
• scientific article; zbMATH DE number 3889279
• Matrix approach to formulate and search k-ESS of graphs using the STP theory
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• An optimal assignment problem with choice strategy

Cited in

(4)

• Matrix formulation of EISs of graphs and its application to WSN covering problems
• Matrix approach to formulate and search k-ESS of graphs using the STP theory
• On the online track assignment problem
• Matrix approach to simplification of finite state machines using semi-tensor product of matrices

This page was built for publication: Solvability of \(k\)-track assignment problem: a graph approach

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