Alidaee Bahram

Bahram Alidaee

Information about the author Bahram Alidaee will soon be added to the site.
Found 22 papers in total
A note on heuristic approach based on UBQP formulation of the maximum diversity problem
A note on heuristic approach based on UBQP formulation of the maximum diversity problem
2017
The maximum diversity problem (MDP) is a challenging NP‐hard problem with a...
Tabu search for solving the black-and-white travelling salesman problem
Tabu search for solving the black-and-white travelling salesman problem
2016
The black‐and‐white travelling salesman problem (BWTSP) is an extension...
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
2009
This paper expands the list of 0-1 problems that can be effectively modelled and...
Simple and fast surrogate constraint heuristics for the maximum independent set problem
Simple and fast surrogate constraint heuristics for the maximum independent set problem
2008
In a recent paper Glover (2003) discussed a variety of surrogate...
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008
The set-partitioning problem (SPP) is widely known for both its application potential...
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008
The set-partitioning problem (SPP) is widely known for both its application potential...
Solving group technology problems via clique partitioning
Solving group technology problems via clique partitioning
2006
This paper presents a new clique partitioning (CP) model for the Group Technology (GT)...
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
2005
Satisfiability (SAT) and Max-SAT problems have been the object of considerable...
An unconstrained quadratic binary programming approach to the vertex coloring problem
An unconstrained quadratic binary programming approach to the vertex coloring problem
2005
The vertex coloring problem has been the subject of extensive research for many years....
A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
2005
The single-sink, fixed-charge transportation problem has a variety of applications,...
Using xQx to model and solve the uncapacitated task allocation problem
Using xQx to model and solve the uncapacitated task allocation problem
2005
This paper illustrates how large instances of the unconstrained task allocation...
Single machine scheduling to minimize total weighted late work: A comparison of scheduling rules and search algorithms
Single machine scheduling to minimize total weighted late work: A comparison of scheduling rules and search algorithms
2002
In this research the problem of scheduling n jobs to minimize the Total Weighted Late...
One-pass heuristics for large-scale unconstrained binary quadratic problems
One-pass heuristics for large-scale unconstrained binary quadratic problems
2002
Many significant advances have been made in recent years for solving unconstrained...
Greedy solutions of selection and ordering problems
Greedy solutions of selection and ordering problems
2001
The greedy method is a well-known technique for approaching problems involving the...
Global optimization for artificial neural networks: A tabu search application
Global optimization for artificial neural networks: A tabu search application
1998
The ability of neural networks to closely approximate unknown functions to any degree...
Adaptive memory tabu search for binary quadratic programs
Adaptive memory tabu search for binary quadratic programs
1998
Recent studies have demonstrated the effectiveness of applying adaptive memory tabu...
A note on the equivalence of two heuristics to minimize total tardiness
A note on the equivalence of two heuristics to minimize total tardiness
1997
Over the last thirty years, many researchers have studied single machine static and...
A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
1997
This paper studies the problem of scheduling a set of n jobs on a single machine to...
Scheduling parallel machines to minimize total weighted and unweighted tardiness
Scheduling parallel machines to minimize total weighted and unweighted tardiness
1997
This article considers the problem of scheduling a set of n jobs on m parallel...
Computing orthogonal polynomials
Computing orthogonal polynomials
1997
A simple transformation for achieving orthogonal polynomials of any order is described...
Two parallel machine sequencing problems involving controllable job processing times
Two parallel machine sequencing problems involving controllable job processing times
1993
In this note the authors consider a problem of scheduling n single-operation jobs on m...
Analyzing total cost for a single machine and n jobs, by use of a symmetric matrix arising from a quadratic form of service times
Analyzing total cost for a single machine and n jobs, by use of a symmetric matrix arising from a quadratic form of service times
1989
Sequencing situations are considered in which a certain number of customers have to be...
Papers per page: