Search
Now showing items 1-10 of 10
Bandwidth packing problem with queueing delays: modelling and exact solution approach
(Springer New York LLC, 2016)
We present a more generalized model for the bandwidth packing problem with queuing delays under congestion than available in the extant literature. The problem, under Poison call arrivals and general service times, is set ...
Managing Workforce at Superior Refinery Limited (SRL) (A)
(Indian Institute of Management Ahmedabad, 2010)
The case deals with the functional and behavioral issues faced by an oil refinery shift in-charge regarding workforce management. In addition to the refinery policy requirements the behavioral constrains become extremely ...
A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
(Springer Verlag, 2017)
The combinatorial bandwidth packing problem (CBPP), arising in a telecommunication network with limited bandwidth, is defined as follows. Given a set of requests, each with its potential revenue, and each consisting of ...
A new valid inequalities for optional communication spanning tree problem
(Informs Journal on Computing, 2019)
The problem of designing a spanning tree on an underlying graph to minimize the flow costs of a given set of traffic demands is considered. Several new classes of valid inequalities are developed for the problem. Tests on ...
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. ...
Source sink flows with capacity installation in batches
(Elsevier, 1998)
We consider the problem of sending flow from a source to a destination where there are flow costs on each arc and fixed costs toward the purchase of capacity. Capacity can be purchased in batches of C units on each arc. ...
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 ...