Exact solution of a class of nonlinear knapsack problems

DOI10.1016/J.ORL.2005.01.004MaRDI QIDQ813968zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• A nonlinear knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems

Cites work

• scientific article; zbMATH DE number 1803764 (Why is no real title available?)
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• A branch and search algorithm for a class of nonlinear knapsack problems
• A nonlinear knapsack problem
• A note on multi-item inventory systems with limited capacity
• An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
• Binary knapsack problems with random budgets
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Simple but efficient approaches for the collapsing knapsack problem
• Solution procedures for the service system design problem
• The nonlinear knapsack problem - algorithms and applications

Cited in

(26)

• Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• A general purpose exact solution method for mixed integer concave minimization problems
• Alternate solution approaches for competitive hub location problems
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
• Fractional 0-1 programming: applications and algorithms
• Solutions of hard knapsack problems using extreme pruning
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• Bandwidth packing problem with queueing delays: modelling and exact solution approach
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Modeling and solving an economies‐of‐scale service system design problem
• Modeling time allocation for prevention in primary care
• The fractional multidimensional knapsack problem: solution and uniqueness
• Fractional 0-1 programming and submodularity
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion
• A well-solvable special case of the bounded knapsack problem
• The maximum ratio clique problem
• Exact approaches for competitive facility location with discrete attractiveness
• Parametric Solution for Linear Bicriteria Knapsack Models
• A branch and price approach for the robust bandwidth packing problem with queuing delays
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• The packing while traveling problem

Describes a project that uses

Uses Software

• Knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813968)