Pages that link to "Item:Q5717533"
From MaRDI portal
The following pages link to Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533):
Displaying 11 items.
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- New results on the equivalence between zero-one programming and continuous concave programming (Q839801) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- Test functions with variable attraction regions for global optimization problems (Q1273055) (← links)
- A class of test functions for global optimization (Q1337132) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
