scientific article; zbMATH DE number 1552036
zbMATH Open1052.90600MaRDI QIDQ4524243FDOQ4524243
Authors: Panos M. Pardalos 
Publication date: 1996
Title of this publication is not available (Why is that?)
Recommendations
global optimizationsemidefinite programmingsatisfiabilityinterior point algorithmsSteiner problemquadratic assignmentminimax theorygraph problemsmax clique
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)
Cited In (26)
- Title not available (Why is that?)
- Discrete processes and their continuous limits
- Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Discontinuous but Well‐Posed Optimization Problems
- Continuous relaxation for discrete DC programming
- Continuous approaches for solving discrete optimization problems
- A problem reduction based approach to discrete optimization algorithm design
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- 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
- Title not available (Why is that?)
- A game-theoretic algorithm for non-linear single-path routing problems
- A discrete dynamic convexized method for nonlinear integer programming
- Title not available (Why is that?)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
- An exact penalty function method for nonlinear mixed discrete programming 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)
