Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Ganian, Robert; Ordyniak, Sebastian

doi:10.3390/a12120248

Cited by 10 publications

(34 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, x n }, the SUBSET SUM problem is to determine if there exists a subset X ′ ⊆ X such that x∈X ′ x = Z. It is known to be weakly NP-hard [Garey and Johnson, 1979]. Given an instance ⟨Z, X⟩ of SUBSET SUM, we construct an MPB instance as follows: For each x i ∈ X, create a project p i with cost x i .…”

Section: Constant Number Of Distinct Votesmentioning

confidence: 99%

See 1 more Smart Citation

Maxmin Participatory Budgeting

Sreedurga

Bhardwaj

Narahari

2022

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

Participatory Budgeting (PB) is a popular voting method by which a limited budget is divided among a set of projects, based on the preferences of voters over the projects. PB is broadly categorised as divisible PB (if the projects are fractionally implementable) and indivisible PB (if the projects are atomic). Egalitarianism, an important objective in PB, has not received much attention in the context of indivisible PB. This paper addresses this gap through a detailed study of a natural egalitarian rule, Maxmin Participatory Budgeting (MPB), in the context of indivisible PB. Our study is in two parts: (1) computational (2) axiomatic. In the first part, we prove that MPB is computationally hard and give pseudo-polynomial time and polynomial-time algorithms when parameterized by certain well-motivated parameters. We propose an algorithm that achieves for MPB, additive approximation guarantees for restricted spaces of instances and empirically show that our algorithm in fact gives exact optimal solutions on real-world PB datasets. We also establish an upper bound on the approximation ratio achievable for MPB by the family of exhaustive strategy-proof PB algorithms. In the second part, we undertake an axiomatic study of the MPB rule by generalizing known axioms in the literature. Our study leads to the proposal of a new axiom, maximal coverage, which captures fairness aspects. We prove that MPB satisfies maximal coverage.

show abstract

Section: Constant Number Of Distinct Votesmentioning

confidence: 99%

“…It is known that the problem of solving an ILP is in FPT when parameterized by the number of constraints and the highest value in coefficient matrix [Ganian and Ordyniak, 2019]. We modify the integer linear program for MPB by replacing N with [n] and c with c ′ .…”

Section: Constant Scalable Limitmentioning

confidence: 99%

Maxmin Participatory Budgeting

Sreedurga

Bhardwaj

Narahari

2022

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…The optimization problem ( 14) becomes an integer linear problem (ILP), which can be solved using off-the-shelf available algorithms [18], [34]. ILP solvers, however, often provide suboptimal solutions to (14), and so we next improve upon the ILP solution by proposing an additional heuristic which shows a good numerical prospect, as illustrated the simulations section of the paper.…”

Section: ) Integer Linear Problem Formulationmentioning

confidence: 99%

Joint User Association and Beamforming in Integrated Satellite-HAPS-Ground Networks

Li¹,

Dahrouj²,

Alouini³

2022

Preprint

View full text Add to dashboard Cite

This paper proposes, and evaluates the benefit of, one particular hybrid satellite-HAPS-ground network, where one high-altitude-platform-station (HAPS) connected to one geo-satellite assists the ground base-stations (BSs) at serving ground-level users. The paper assumes that the geo-satellite is connected to the HAPS using free-space-optical backhaul link. The HAPS, equipped with multiple antennas, aims at transmitting the geo-satellite data to the users via radio-frequency (RF) links using spatial-multiplexing. Each ground BS, on the other hand, is equipped with multiple antennas and serves users through RF links. The paper then focuses on maximizing the network-wide throughput, subject to user-connectivity constraints, HAPS and BSs power constraints, and backhaul constraints, so as to jointly determine the user-association strategy of each user (i.e., user to geo-satellite via HAPS, or user to BS), and their associated beamforming vectors. We tackle such a mixed discrete-continuous optimization problem using an iterative approach, where the user-association is determined using a combination of linear integer programming and generalized assignment problems, and where the beamforming strategy is found using a weighted-minimum-mean-squared-error approach. The simulations illustrate the appreciable gain of our proposed algorithm, and highlight the prospects of augmenting the ground networks with beamforming-empowered HAPS for connecting the unconnected, and super-connecting the connected.

show abstract

“…To reduce the latency, the middleboxes are placed at locations where the communication is the shortest using a placement selection algorithm. The middleboxes are placed in different locations and an offline Integer Linear Program (ILP) pruning algorithm [120] is deployed at each middlebox. ILP helps in solving uncontrollable computation optimization problems at every middlebox to tackle the switch constraints, such as the use of CPU, RAM, etc.…”

Section: E Data Integritymentioning

confidence: 99%

Fast, Reliable, and Secure Drone Communication: A Comprehensive Survey

Hassija,

Chamola,

Agrawal

et al. 2021

Preprint

View full text Add to dashboard Cite

Drone security is currently a major topic of discussion among researchers and industrialists. Although there are multiple applications of drones, if the security challenges are not anticipated and required architectural changes are not made, the upcoming drone applications will not be able to serve their actual purpose. Therefore, in this paper, we present a detailed review of the security-critical drone applications, and security-related challenges in drone communication such as DoS attacks, Man-in-the-middle attacks, De-Authentication attacks, and so on. Furthermore, as part of solution architectures, the use of Blockchain, Software Defined Networks (SDN), Machine Learning, and Fog/Edge computing are discussed as these are the most emerging technologies. Drones are highly resource-constrained devices and therefore it is not possible to deploy heavy security algorithms on board. Blockchain can be used to cryptographically store all the data that is sent to/from the drones, thereby saving it from tampering and eavesdropping. Various ML algorithms can be used to detect malicious drones in the network and to detect safe routes. Additionally, the SDN technology can be used to make the drone network reliable by allowing the controller to keep a close check on data traffic, and fog computing can be used to keep the computation capabilities closer to the drones without overloading them.

show abstract

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Cited by 10 publications

References 36 publications

Maxmin Participatory Budgeting

Maxmin Participatory Budgeting

Joint User Association and Beamforming in Integrated Satellite-HAPS-Ground Networks

Fast, Reliable, and Secure Drone Communication: A Comprehensive Survey

Contact Info

Product

Resources

About