Sparse Monge matrices arising from scheduling problems

DOI10.1016/j.orl.2013.01.011zbMath1286.90057OpenAlexW2030708365MaRDI QIDQ2450613

Michael O. Ball, Charles N. Glover

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

schedulingair traffic managementtransportation problemMonge matrices

Mathematics Subject Classification ID

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

Related Items (2)

Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem ⋮ Four-point conditions for the TSP: the complete complexity classification

Cites Work

• Unnamed Item
• Monge and feasibility sequences in general flow problems
• Perspectives of Monge properties in optimization
• Optimization and mediated bartering models for ground delay programs
• Maximum matching in a convex bipartite graph

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