A discrete dynamic convexized method for nonlinear integer programming
From MaRDI portal
Publication:953398
Recommendations
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A filled function method for box constrained nonlinear integer programming
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- An auxiliary function method for global minimization in integer programming
Cites work
- scientific article; zbMATH DE number 3821078 (Why is no real title available?)
- scientific article; zbMATH DE number 4008100 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 1302172 (Why is no real title available?)
- scientific article; zbMATH DE number 2068701 (Why is no real title available?)
- scientific article; zbMATH DE number 1552036 (Why is no real title available?)
- scientific article; zbMATH DE number 1558263 (Why is no real title available?)
- scientific article; zbMATH DE number 1383429 (Why is no real title available?)
- scientific article; zbMATH DE number 3793783 (Why is no real title available?)
- scientific article; zbMATH DE number 3197060 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Monte-Carlo approach for 0-1 programming problems
- A branch and bound algorithm for solving separable convex integer programming problems
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- A continuous approach to nonlinear integer programming
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for finding a global minimizer on global integer optimization
- A new filled function method for nonlinear integer programming problem
- A note on adapting methods for continuous global optimization to the discrete case
- An algorithm for indefinite integer quadratic programming
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- An efficient algorithm to solve integer-programming problems arising in system-reliability design
- An exact penalty function approach for nonlinear integer programming problems
- An integrated plant loading model with economies of scale and scope
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Calculation of Investment Portfolios with Risk Free Borrowing and Lending
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Discrete filled function method for discrete global optimization
- General local search methods
- Integral global minimization: Algorithms, implementations and numerical tests
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Methods of Nonlinear 0-1 Programming
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- On the investigation of stochastic global optimization algorithms
- The Tunneling Algorithm for the Global Minimization of Functions
- The globally convexized filled functions for global optimization
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
Cited in
(17)- scientific article; zbMATH DE number 4143777 (Why is no real title available?)
- A note on ``A continuous approach to nonlinear integer programming
- The auxiliary function method for resolving decision making problem
- A discrete dynamic convexized method for the max-cut problem
- An auxiliary function method for global minimization in integer programming
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures
- Nonlinear integer programming for various forms of constraints
- An effective discrete dynamic convexized method for solving the winner determination problem
- Weighted differentiation composition operators from mixed-norm to Zygmund spaces
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- A method for convex black-box integer global optimization
- scientific article; zbMATH DE number 4029261 (Why is no real title available?)
- A discrete dynamic convexized method for VLSI circuit partitioning
This page was built for publication: A discrete dynamic convexized method for nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953398)
