scientific article; zbMATH DE number 3874960

MaRDI QIDQ3340500zbMATH OpenFDO

Authors Rodica Avram-Nitchi

Publication date 1981

zbMATH Keywords

time-criterion allocation problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3889279
• A resource allocation problem on timed marked graphs: a decomposition approach
• A graph theoretic approach to the slot allocation problem
• scientific article; zbMATH DE number 1192302
• A graphical method to solve a family of allocation problems
• scientific article; zbMATH DE number 3910116
• scientific article; zbMATH DE number 4193445
• Some optimization problems for timed marked graphs
• scientific article; zbMATH DE number 4189459
• Some uses of hypergraphs in timetabling

Cited in

(10)

• An improved approach for marking optimization of timed weighted marked graphs
• A graph theoretic approach to the slot allocation problem
• scientific article; zbMATH DE number 3889279 (Why is no real title available?)
• scientific article; zbMATH DE number 3910116 (Why is no real title available?)
• scientific article; zbMATH DE number 1192302 (Why is no real title available?)
• scientific article; zbMATH DE number 563124 (Why is no real title available?)
• Regular set of representatives for time-constrained MSC graphs
• Some optimization problems for timed marked graphs
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
• scientific article; zbMATH DE number 4189459 (Why is no real title available?)

This page was built for publication:

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