2015
DOI: 10.1080/02522667.2014.932092
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We propose a gradient-based optimization procedure consisting of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or non-linear constraints. In the first phase a local minimum of the function is found using the gradient approach coupled with hemstitching moves when a constraint is violated in order to return the search to a feasible region. In the second phase a tunneling function is constructed at this local minimum in ord… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 49 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?