Pages that link to "Item:Q1017442"
From MaRDI portal
The following pages link to Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442):
Displaying 5 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← 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)
