Pages that link to "Item:Q3901304"
From MaRDI portal
The following pages link to A Survey of Methods for Pure Nonlinear Integer Programming (Q3901304):
Displaying 26 items.
- A branch and search algorithm for a class of nonlinear knapsack problems (Q594771) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Conjugate duality and the curse of dimensionality (Q811416) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A real coded genetic algorithm for solving integer and mixed integer optimization problems (Q1026327) (← links)
- An extended continuous maximal covering location problem with facility placement (Q1086128) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
- Logarithmic-exponential penalty formulation for integer programming (Q1961727) (← links)
- Discrete optimization by optimal control methods. I: Separable problems (Q2457533) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Reduction of nonlinear integer separable programming problems<sup>∗</sup> (Q3807881) (← links)
- Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)