The following pages link to Nonlinear Integer Programming (Q3565244):
Displaying 33 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← links)
- Optimal rank-sparsity decomposition (Q486401) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- Complex and quaternionic optimization (Q2061302) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
- A hybrid artificial immune network for detecting communities in complex networks (Q2517303) (← links)
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
- Automata for Analysing Service Contracts (Q2811923) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport (Q5203796) (← links)
- A Numerical Method for Solving Quadratic Integer Programming Problem (Q5212531) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
