Pages that link to "Item:Q1600928"

The following pages link to The nonlinear knapsack problem - algorithms and applications (Q1600928):

Displaying 50 items.

• An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
• Competitive facility location model with concave demand (Q877034) (← links)
• On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
• Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• Bicriteria robotic operation allocation in a flexible manufacturing cell (Q1040977) (← links)
• Exact and heuristic methods for the selective maintenance problem (Q1042033) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• A note on a general nonlinear knapsack problem (Q1081534) (← links)
• A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
• A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726) (← links)
• Solving the 0-1 proportional knapsack problem by sampling (Q1321464) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• The packing while traveling problem (Q1751654) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
• On speed scaling via integer programming (Q1785426) (← links)
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• Optimizing facility location and design (Q2028796) (← links)
• An efficient algorithm of dead-end controls for solving combinatorial optimization problems (Q2069680) (← links)
• Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
• Cooperative and axiomatic approaches to the knapsack allocation problem (Q2095938) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Single-period stochastic demand fulfillment in customer hierarchies (Q2184113) (← links)
• Workweek optimization of experimental designs: exact designs for variable sampling costs (Q2260184) (← links)
• Allocation planning under service-level contracts (Q2272313) (← links)
• The stochastic transportation problem with single sourcing (Q2275818) (← links)