dynamic convexized method Latest Research Papers

Solving Hardware/Software Partitioning via a Discrete Dynamic Convexized Method

Wuhan University Journal of Natural Sciences ◽

10.1007/s11859-019-1405-7 ◽

2019 ◽

Vol 24 (4) ◽

pp. 341-348

Author(s):

Geng Lin

Keyword(s):

Discrete Dynamic ◽

Dynamic Convexized Method ◽

Software Partitioning

Download Full-text

An effective discrete dynamic convexized method for solving the winner determination problem

Journal of Combinatorial Optimization ◽

10.1007/s10878-015-9883-9 ◽

2015 ◽

Vol 32 (2) ◽

pp. 563-593 ◽

Cited By ~ 3

Author(s):

Geng Lin ◽

Wenxing Zhu ◽

M. Montaz Ali

Keyword(s):

Winner Determination Problem ◽

Winner Determination ◽

Discrete Dynamic ◽

Dynamic Convexized Method

Download Full-text

Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem

Journal of the Operations Research Society of China ◽

10.1007/s40305-014-0045-z ◽

2014 ◽

Vol 2 (2) ◽

pp. 237-262 ◽

Cited By ~ 1

Author(s):

Geng Lin ◽

Wenxing Zhu

Keyword(s):

Discrete Dynamic ◽

Max Cut Problem ◽

Dynamic Convexized Method

Download Full-text

A discrete dynamic convexized method for VLSI circuit partitioning

Optimization Methods and Software ◽

10.1080/10556788.2012.663372 ◽

2013 ◽

Vol 28 (4) ◽

pp. 670-688

Author(s):

Jiarui Chen ◽

Wenxing Zhu

Keyword(s):

Vlsi Circuit ◽

Circuit Partitioning ◽

Discrete Dynamic ◽

Dynamic Convexized Method

Download Full-text

Max-k-Cut by the Discrete Dynamic Convexized Method

INFORMS Journal on Computing ◽

10.1287/ijoc.1110.0492 ◽

2013 ◽

Vol 25 (1) ◽

pp. 27-40 ◽

Cited By ~ 8

Author(s):

Wenxing Zhu ◽

Geng Lin ◽

M. M. Ali

Keyword(s):

Discrete Dynamic ◽

Dynamic Convexized Method

Download Full-text

Solving the weighted MAX-SAT problem using the dynamic convexized method

Optimization Letters ◽

10.1007/s11590-012-0583-4 ◽

2012 ◽

Vol 8 (1) ◽

pp. 359-374

Author(s):

Wenxing Zhu ◽

Yuanhui Yan

Keyword(s):

Sat Problem ◽

Max Sat ◽

Dynamic Convexized Method

Download Full-text

A discrete dynamic convexized method for the max-cut problem

Annals of Operations Research ◽

10.1007/s10479-012-1133-2 ◽

2012 ◽

Vol 196 (1) ◽

pp. 371-390 ◽

Cited By ~ 7

Author(s):

Geng Lin ◽

Wenxing Zhu

Keyword(s):

Discrete Dynamic ◽

Max Cut Problem ◽

Dynamic Convexized Method

Download Full-text

A dynamic convexized method for nonconvex mixed integer nonlinear programming

Computers & Operations Research ◽

10.1016/j.cor.2011.02.014 ◽

2011 ◽

Vol 38 (12) ◽

pp. 1792-1804 ◽

Cited By ~ 4

Author(s):

Wenxing Zhu ◽

Geng Lin

Keyword(s):

Nonlinear Programming ◽

Mixed Integer Nonlinear Programming ◽

Mixed Integer ◽

Integer Nonlinear Programming ◽

Dynamic Convexized Method

Download Full-text

A dynamic convexized method for the TSP

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems ◽

10.1109/icicisys.2010.5658682 ◽

2010 ◽

Author(s):

Miaoling Wu ◽

Wenxing Zhu

Keyword(s):

Dynamic Convexized Method

Download Full-text

Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

Computers & Operations Research ◽

10.1016/j.cor.2008.12.002 ◽

2009 ◽

Vol 36 (10) ◽

pp. 2723-2728 ◽

Cited By ~ 9

Author(s):

Wenxing Zhu ◽

M.M. Ali

Keyword(s):

Integer Programming ◽

Nonlinear Integer Programming ◽

Discrete Dynamic ◽

Dynamic Convexized Method

Download Full-text

dynamic convexized method
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

Solving Hardware/Software Partitioning via a Discrete Dynamic Convexized Method

An effective discrete dynamic convexized method for solving the winner determination problem

Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem

A discrete dynamic convexized method for VLSI circuit partitioning

Max-k-Cut by the Discrete Dynamic Convexized Method

Solving the weighted MAX-SAT problem using the dynamic convexized method

A discrete dynamic convexized method for the max-cut problem

A dynamic convexized method for nonconvex mixed integer nonlinear programming

A dynamic convexized method for the TSP

Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

Export Citation Format

dynamic convexized methodRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

Solving Hardware/Software Partitioning via a Discrete Dynamic Convexized Method

An effective discrete dynamic convexized method for solving the winner determination problem

Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem

A discrete dynamic convexized method for VLSI circuit partitioning

Max-k-Cut by the Discrete Dynamic Convexized Method

Solving the weighted MAX-SAT problem using the dynamic convexized method

A discrete dynamic convexized method for the max-cut problem

A dynamic convexized method for nonconvex mixed integer nonlinear programming

A dynamic convexized method for the TSP

Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

dynamic convexized method
Recently Published Documents