The following pages link to (Q5494211):
Displaying 17 items.
- Manifold relaxations for integer programming (Q380594) (← links)
- A gradient-based approach for discrete optimum design (Q381494) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Continuous representations and functional extensions in combinatorial optimization (Q508577) (← links)
- A continuous approach to combinatorial optimization: application of water system pump operations (Q691421) (← 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)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- (Q5093671) (← links)
- Adaptive randomization in network data (Q6200871) (← links)
