Pardalos Panos M.

Panos M. Pardalos

Information about the author Panos M. Pardalos will soon be added to the site.
Found 51 papers in total
Global minimization algorithms for concave quadratic programming problems
Global minimization algorithms for concave quadratic programming problems
2005
In this article, we consider the concave quadratic programming problem which is known...
A combinatorial algorithm for message scheduling on controller area networks
A combinatorial algorithm for message scheduling on controller area networks
2005
A controller area network (CAN) is a special-purpose communications system, used for...
A hybrid genetic–GRASP algorithm using Langrangean relaxation for the traveling salesman problem
A hybrid genetic–GRASP algorithm using Langrangean relaxation for the traveling salesman problem
2005
Hybridization techniques are very effective for the solution of combinatorial...
Expanding neighborhood GRASP for the traveling salesman problem
Expanding neighborhood GRASP for the traveling salesman problem
2005
In this paper, we present the application of a modified version of the well known...
A survey of combinatorial optimization problems in multicast routing
A survey of combinatorial optimization problems in multicast routing
2005
In multicasting routing, the main objective is to send data from one or more sources...
Branch and bound algorithms for the multidimensional assignment problem
Branch and bound algorithms for the multidimensional assignment problem
2005
This work investigates two branch and bound algorithms based on different tree...
Dynamical approaches and multi-quadratic integer programming for seizure prediction
Dynamical approaches and multi-quadratic integer programming for seizure prediction
2005
In this article, we present dynamical approaches and multi-quadratic integer...
On complexity of unconstrained hyperbolic 0–1 programming problems
On complexity of unconstrained hyperbolic 0–1 programming problems
2005
Single- and multiple-ratio unconstrained hyperbolic 0–1 programming problems are...
Asymptotic properties of random multidimensional assignment problems
Asymptotic properties of random multidimensional assignment problems
2004
The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization...
A new linearization technique for multi-quadratic 0–1 programming problems
A new linearization technique for multi-quadratic 0–1 programming problems
2004
We consider the reduction of multi-quadratic 0–1 programming problems to linear...
Greedy randomized adaptive search procedure with a new local search scheme for vehicle routing problems with time windows
Greedy randomized adaptive search procedure with a new local search scheme for vehicle routing problems with time windows
2003
The NP-Hard Vehicle Routing Problem with Time Windows (VRPTW) is one of the major...
Network optimization in supply chain management and financial engineering: An annotated bibliography
Network optimization in supply chain management and financial engineering: An annotated bibliography
2003
During the past decade, two relatively new application areas have attracted the...
Randomized heuristics for the max-cut problem
Randomized heuristics for the max-cut problem
2002
Given an undirected graph with edge weights, the max-cutproblem consists in finding a...
Nonlinear dynamical systems and adaptive filters in biomedicine
Nonlinear dynamical systems and adaptive filters in biomedicine
2003
In this paper we present the application of a method of adaptive estimation using an...
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
2000
In this paper, we propose an efficient heuristic approach for solving concave...
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
1999
In this paper, we consider the Fixed Charge Network Flow Problem (FCNFP) which is...
Parametric linear programming techniques for the indefinite quadratic programming problem
Parametric linear programming techniques for the indefinite quadratic programming problem
1992
In this paper, we discuss a multiparametric technique for finding a global minimum for...
Approximate solutions to the turbine balancing problem
Approximate solutions to the turbine balancing problem
2001
The turbine balancing problem (TBP) is an NP-Hard combinatorial optimization problem...
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
2000
This paper describes Fortran subroutines for computing approximate solutions to the...
A heuristic for the Steiner problem in graphs
A heuristic for the Steiner problem in graphs
1996
In this paper, we present a heuristic for the Steiner problem in graphs along with...
Simulated annealing and genetic algorithms for the facility layout problem: A survey
Simulated annealing and genetic algorithms for the facility layout problem: A survey
1997
The facility layout problem (FLP) has many practical applications and is known to be...
The simplex algorithm with a new primal and dual pivot rule
The simplex algorithm with a new primal and dual pivot rule
1994
The authors present a simplex-type algorithm for linear programming that works with...
Parallel computing in nonconvex programming
Parallel computing in nonconvex programming
1993
In this paper, the authors are concerned with the development of parallel algorithms...
Computational techniques for solving global optimization problems
Computational techniques for solving global optimization problems
1991
Global optimization has been the subject of active research in the last two decades....
Papers per page: