A MIP model for scheduling India's general elections and police movement

DOI10.1007/S12597-013-0160-3zbMath1332.90153OpenAlexW1989638351WikidataQ57831158 ScholiaQ57831158MaRDI QIDQ260654

Bodhibrata Nag

Publication date: 22 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-013-0160-3

zbMATH Keywords

schedulingassignmentlogisticsMIP modelOR in government

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) History, political science (91F10)

Cites Work

• Selected topics on assignment problems
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Assignment problems: a golden anniversary survey
• Heuristic and exact algorithms for the simultaneous assignment problem
• A Survey of Linear Cost Multicommodity Network Flows
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: A MIP model for scheduling India's general elections and police movement