Competitive strategies of U.S. presidential candidates in election campaigns

DOI10.1016/j.camwa.2005.01.005zbMath1115.91316OpenAlexW2003386791MaRDI QIDQ2485419

A. S. Belen'kij

Publication date: 4 August 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.01.005

zbMATH Keywords

Discrete optimization problemsGames on polyhedral setsProblems with mixed variables

Mathematics Subject Classification ID

Applications of game theory (91A80) Voting theory (91B12) History, political science (91F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A planning problem in the class of linear models
• Minimax planning problems with linear constraints and methods of their solution
• Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management
• A 2-person game on a polyhedral set of connected strategies
• A noncooperative game on polyhedral sets
• Optimization of planning an advertising campaign of goods and services.
• Analyzing the potential of a firm: an operations research approach.
• Packing problems and project scheduling models: an integrating perspective
• An Application of Bin-Packing to Multiprocessor Scheduling
• An approach to planning an advertising campaign of goods and services

This page was built for publication: Competitive strategies of U.S. presidential candidates in election campaigns