Polarization reduction by minimum-cardinality edge additions: Complexity and integer programming approaches.
Ruben InterianJorge R. MorenoCelso C. RibeiroPublished in: Int. Trans. Oper. Res. (2021)
Keyphrases
- integer programming
- np hard
- round robin tournament
- linear programming
- column generation
- constraint programming
- inference problems
- cutting plane
- integer program
- integer programming formulations
- set covering problem
- vehicle routing problem with time windows
- valid inequalities
- ai planning
- linear program
- worst case
- network flow
- cutting plane algorithm
- genetic algorithm