Pages that link to "Item:Q953398"
From MaRDI portal
The following pages link to A discrete dynamic convexized method for nonlinear integer programming (Q953398):
Displaying 10 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures (Q606178) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- A note on ``A continuous approach to nonlinear integer programming'' (Q1039712) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400) (← links)
- Weighted Differentiation Composition Operators from Mixed-Norm to Zygmund Spaces (Q3058364) (← links)
