scientific article; zbMATH DE number 1552036

MaRDI QIDQ4524243zbMATH OpenFDO

Authors Panos M. Pardalos

Publication date 1996

zbMATH Keywords

global optimizationsemidefinite programmingsatisfiabilityinterior point algorithmsSteiner problemquadratic assignmentminimax theorygraph problemsmax clique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Interior-point methods (90C51) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Minimax problems in mathematical programming (90C47)

Recommendations

• Continuous approaches for solving discrete optimization problems
• scientific article; zbMATH DE number 432990
• Problems of discrete optimization: challenges and main approaches to solve them
• scientific article; zbMATH DE number 1054758
• Continuous relaxation for discrete DC programming

Cited in

(26)

• scientific article; zbMATH DE number 4101970 (Why is no real title available?)
• Discrete processes and their continuous limits
• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Penalty parameter for linearly constrained 0--1 quadratic programming
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• A problem reduction based approach to discrete optimization algorithm design
• Discontinuous but Well‐Posed Optimization Problems
• Continuous relaxation for discrete DC programming
• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
• Continuous approaches for solving discrete optimization problems
• Continuous approximate solutions in parametric optimization
• Continuous relaxation for discrete DC programming
• A continuous strategy to solve a class of discrete optimization problems
• An algorithm for nonlinear optimization problems with binary variables
• scientific article; zbMATH DE number 432990 (Why is no real title available?)
• A game-theoretic algorithm for non-linear single-path routing problems
• A discrete dynamic convexized method for nonlinear integer programming
• scientific article; zbMATH DE number 1187201 (Why is no real title available?)
• A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
• scientific article; zbMATH DE number 5240484 (Why is no real title available?)
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
• Annealed replication: A new heuristic for the maximum clique problem
• scientific article; zbMATH DE number 4064765 (Why is no real title available?)
• An exact penalty function method for nonlinear mixed discrete programming problems
• APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
• A soft approach for hard continuous optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524243)