NDLI: Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model

Content Provider	Springer Nature Link
Author	Cello, Marco Gnecco, Giorgio Sanguineti, Marcello Marchese, Mario
Copyright Year	2014
Abstract	Call admission control with two classes of users is investigated via a nonlinear stochastic knapsack model. The feasibility region represents the subset of the call space, where given constraints on the quality of service have to be satisfied. Admissible strategies are searched for within the class of coordinate-convex policies. Structural properties that the optimal policies belonging to such a class have to satisfy are derived. They are exploited to narrow the search for the optimal solution to the nonlinear stochastic knapsack problem that models call admission control. To illustrate the role played by these properties, the numbers of coordinate-convex policies by which they are satisfied are estimated. A graph-based algorithm to generate all such policies is presented.
Ending Page	841
Page Count	23
Starting Page	819
File Format	PDF
ISSN	00223239
e-ISSN	15732878
Journal	Journal of Optimization Theory and Applications
Issue Number	3
Volume Number	164
Language	English
Publisher	Springer US
Publisher Date	2014-04-30
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Call admission control Network models, stochastic Theory of Computation Network design and communication Combinatorial optimization Nonlinear constraints Optimization Integer programming Engineering Calculus of Variations and Optimal Control; Optimization Operations Research/Decision Theory Coordinate-convex policies Applications of Mathematics Communication networks Stochastic knapsack Structural properties
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Management Science and Operations Research

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimality Conditions for Coordinate-Convex Policies in CAC With Nonlinear Feasibility Boundaries

Irreducible Infeasible Sets in Convex Mixed-Integer Programs

Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs

SICOpt: Solution Approach for Nonlinear Integer Stochastic Programming Problems

Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle

Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

Outer Approximation Algorithm for One Class of Convex Mixed-Integer Nonlinear Programming Problems with Partial Differentiability

Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model

Similar Documents

Optimality Conditions for Coordinate-Convex Policies in CAC With Nonlinear Feasibility Boundaries

Irreducible Infeasible Sets in Convex Mixed-Integer Programs

Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs

SICOpt: Solution Approach for Nonlinear Integer Stochastic Programming Problems

Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle

Enhancements on the Hyperplanes Arrangements in Mixed-Integer Programming Techniques

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

Outer Approximation Algorithm for One Class of Convex Mixed-Integer Nonlinear Programming Problems with Partial Differentiability

Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model