Search
Now showing items 1-5 of 5
A cutting plane approach for the multi-machine precedence-constrained scheduling problem
(Springer, 2020)
A cutting-plane approach is developed for the problem of optimally scheduling jobs with arbitrary precedence constraints on unrelated parallel machines to minimize weighted completion time. While the single machine version ...
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
(Elsevier, 2021-09-10)
We present an efficient cutting-plane based approach to exactly solve a directed fixed charge network design (DFCND) problem, wherein the valid inequalities to the problem are generated using the polar duality approach. ...
A two-stage integer programming model considering transaction equivalence for privacy preservation
(Elsevier, 2022-08-17)
Preserving privacy is one of the fundamental requirements of firms that share data with their business partners for building advanced data mining models. Firms often aim to protect the disclosure of sensitive knowledge or ...
A framework for fair decision-making over time with time-invariant utilities
(Elsevier, 2023-12-02)
Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-making problem. This paper examines repeated ...
When Nash meets Stackelberg
(INFORMS, 2023-12-22)
This article introduces a class of Nash games among Stackelberg players (NASPs), namely, a class of simultaneous noncooperative games where the players solve sequential Stackelberg games. Specifically, each player solves ...