The following pages link to (Q4524243):
Displaying 10 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- A game-theoretic algorithm for non-linear single-path routing problems (Q325393) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
- An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)