Estimating the size of the calling population in finite-source election queues by bilinear programming techniques
DOI10.1016/J.MCM.2006.08.007zbMATH Open1170.90360OpenAlexW2054380867MaRDI QIDQ2473232FDOQ2473232
Publication date: 26 February 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2006.08.007
Recommendations
linear programming problemsvoter turnoutfinite source queuing systemsbilinear programming problemsprecinctsvoting machines
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Adjustable robust solutions of uncertain linear programs
- Title not available (Why is that?)
- A linear programming approach to solving bilinear programmes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management
Cited In (2)
This page was built for publication: Estimating the size of the calling population in finite-source election queues by bilinear programming techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473232)