Disaggregation and Resource Allocation Using Convex Knapsack Problems With Bounded Variables

Management Science - United States
doi 10.1287/mnsc.27.4.431
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

On Control Problems With Bounded State Variables

Journal of Mathematical Analysis and Applications
Applied MathematicsAnalysis
1962English

Neural Network Approach for Solving Singular Convex Optimization With Bounded Variables

Open Journal of Applied Sciences
2013English

Resource Allocation Problems in Decentralized Energy Management

Operations-Research-Spektrum
Management ScienceOperations Research
2017English

Lifting Gomory Cuts With Bounded Variables

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2013English

Concave Resource Allocation Problems for Interference Coupled Wireless Systems

2010English

Functions With Bounded Variation in Locally Convex Space

Tatra Mountains Mathematical Publications
Mathematics
2011English

Scheduling and Traffic Allocation for Tasks With Bounded Splittability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Solving Large-Scale Resource Allocation Problems : Formulations, Solutions and Case Studies

English

Bounded Variables Nonlinear Multiple Criteria Optimization Using Scatter Search

Revista de Matemática: Teoría y Aplicaciones
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy