The following pages link to Nonlinear integer programming (Q2493143):
Displaying 48 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- Simultaneous routing and flow rate optimization in energy-aware computer networks (Q285426) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints (Q693550) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Mathematical model for efficient water flow management (Q974575) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
- Multi-choice probabilistic linear programming problem (Q1684324) (← links)
- A subgradient approach for constrained binary optimization via quantum adiabatic evolution (Q1699979) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- Reconstruction of hv-convex sets by their coordinate X-ray functions (Q2251295) (← links)
- Impact of price-adjustments costs on integration of pricing and production planning of multiple-products (Q2257082) (← links)
- Optimal deployment of vehicles with circular formation for bearings-only multi-target localization (Q2280706) (← links)
- Optimum management of the network of city bus routes based on a stochastic dynamic model (Q2313754) (← links)
- Numerical simulation of gas flows through a cubic pack of nonspherical particles (Q2354467) (← links)
- Resource sharing among real-time components under multiprocessor clustered scheduling (Q2443942) (← links)
- A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- A novel analytical integer optimization method for wavelet based subband coding (Q2798128) (← links)
- Strong duality in optimization: shifted power reformulation (Q2829558) (← links)
- A branch-and-bound algorithm for discrete multi-factor portfolio optimization model (Q3538479) (← links)
- Matrix decomposition and Lagrangian dual method for discrete portfolio optimization under concave transaction costs (Q3572640) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming (Q4971025) (← links)
- Linear programming problems with some multi-choice fuzzy parameters (Q4987787) (← links)
- (Q5021865) (← links)
- Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- A Numerical Method for Solving Quadratic Integer Programming Problem (Q5212531) (← links)
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
- Global Optimization Approaches to Sensor Placement: Model Versions and Illustrative Results (Q5270071) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
- DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- A unifying framework for sparsity-constrained optimization (Q6086139) (← links)
