Sparse Monge matrices arising from scheduling problems

DOI10.1016/J.ORL.2013.01.011MaRDI QIDQ2450613zbMATH OpenOpenAlexFDO

Authors Charles N. Glover, Michael O. Ball

Publication date 14 May 2014

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2013.01.011

zbMATH Keywords

schedulingtransportation problemair traffic managementMonge matrices

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special matrices (15B99)

Recommendations

• An algorithm for the detection and construction of Monge sequences
• On Monge sequences in \(d\)-dimensional arrays
• Monge and feasibility sequences in general flow problems
• scientific article; zbMATH DE number 2154257
• Monge sequences and a simple assignment algorithm

Cites work

• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• Maximum matching in a convex bipartite graph
• Monge and feasibility sequences in general flow problems
• Optimization and mediated bartering models for ground delay programs
• Perspectives of Monge properties in optimization

Cited in

(5)

• An algorithm for the detection and construction of Monge sequences
• Four-point conditions for the TSP: the complete complexity classification
• Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling
• Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
• scientific article; zbMATH DE number 3928704 (Why is no real title available?)

This page was built for publication: Sparse Monge matrices arising from scheduling problems

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