Exact solution of a class of nonlinear knapsack problems

DOI10.1016/j.orl.2005.01.004zbMath1141.90510OpenAlexW2009380504MaRDI QIDQ813968

Samir Elhedhli

Publication date: 2 February 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.01.004

zbMATH Keywords

dynamic programmingnonlinearstochasticpiecewise linearizationcutting plane methodsKnapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (19)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Efficient solution of a class of location-allocation problems with stochastic demand and congestion ⋮ Service system design with immobile servers, stochastic demand and concave-cost capacity selection ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ Fractional 0-1 programming and submodularity ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ Modeling time allocation for prevention in primary care ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Modeling and solving an economies‐of‐scale service system design problem ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ The packing while traveling problem ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Alternate solution approaches for competitive hub location problems ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays ⋮ The maximum ratio clique problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• A note on multi-item inventory systems with limited capacity
• Solution procedures for the service system design problem
• Simple but efficient approaches for the collapsing knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• A nonlinear knapsack problem
• An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
• Binary knapsack problems with random budgets

This page was built for publication: Exact solution of a class of nonlinear knapsack problems