scientific article; zbMATH DE number 7457429
From MaRDI portal
Publication:5021865
zbMath1477.90093MaRDI QIDQ5021865
Won Hee Lim, Tran Van Thang, Jong Kyu Kim
Publication date: 14 January 2022
Full work available at URL: http://nfaa.kyungnam.ac.kr/journal-nfaa/index.php/NFAA/article/view/1443
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual extragradient algorithms extended to equilibrium problems
- Problems with resource allocation constraints and optimization over the efficient set
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A hybrid method for solving nonlinear knapsack problems
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
- Conjugate duality and optimization over weakly efficient set
- Nonlinear integer programming
- Monotonic Optimization: Problems and Solution Approaches
- Contraction mapping fixed point algorithms for solving multivalued mixed variational inequalities
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
- A hybrid approach to discrete mathematical programming
- Two Projection Methods for Solving the Split Common Fixed Point Problem with Multiple Output Sets in Hilbert Spaces
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- On Quasi-Convex Duality
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- \(p\)th power Lagrangian method for integer programming
This page was built for publication:
