2025
Renewable Energy Prediction: A Comparative Study of Deep Learning Models for Complex Dataset Analysis.
CoRR, January, 2025
2024
Fast Local Search Strategies for Large-Scale General Quadratic Integer Programming.
CoRR, 2024
Hybrid Heuristic Algorithms for Adiabatic Quantum Machine Learning Models.
CoRR, 2024
Enhancing supply chain security with automated machine learning.
CoRR, 2024
A Unified Framework for Integer Programming Formulation of Graph Matching Problems.
CoRR, 2024
Fast Adaptive Meta-Heuristic for Large-Scale Facility Location Problem.
CoRR, 2024
Optimization Approaches for a General Class of Single-Machine Scheduling Problems.
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
A new hybrid-heuristic for large-scale combinatorial optimization: A case of quadratic assignment problem.
Comput. Ind. Eng., May, 2023
An Efficient Closed-Form Formula for Evaluating r-Flip Moves in Quadratic Unconstrained Binary Optimization.
Algorithms, 2023
2022
Integrating Machine Learning Algorithms With Quantum Annealing Solvers for Online Fraud Detection.
IEEE Access, 2022
Leveraging the Influence of Power Grid Links in Renewable Energy Power Generation.
IEEE Access, 2022
2021
The multi-skilled multi-period workforce assignment problem.
Int. J. Prod. Res., 2021
2019
A unified view of parallel machine scheduling with interdependent processing rates.
J. Sched., 2019
2018
Unrelated Parallel Machine Selection and Job Scheduling With the Objective of Minimizing Total Workload and Machine Fixed Costs.
IEEE Trans Autom. Sci. Eng., 2018
Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem.
Ann. Oper. Res., 2018
2017
A note on heuristic approach based on UBQP formulation of the maximum diversity problem.
J. Oper. Res. Soc., 2017
Simple and fast novel diversification approach for the UBQP based on sequential improvement local search.
Comput. Ind. Eng., 2017
2016
Tabu search for solving the black-and-white travelling salesman problem.
J. Oper. Res. Soc., 2016
2014
Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network.
J. Intell. Robotic Syst., 2014
Critical Infrastructure Management for Telecommunication Networks.
Int. J. Knowl. Syst. Sci., 2014
Zero duality gap in surrogate constraint optimization: A concise review of models.
Eur. J. Oper. Res., 2014
2012
Critical Infrastructure Management for Telecommunication Networks.
Proceedings of the Active Media Technology - 8th International Conference, 2012
2011
On the Flexible Demand Assignment Problems: Case of Unmanned Aerial Vehicles.
IEEE Trans Autom. Sci. Eng., 2011
Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks.
Ad Hoc Networks, 2011
2010
Theorems Supporting r-flip Search for Pseudo-Boolean Optimization.
Int. J. Appl. Metaheuristic Comput., 2010
A study of the relative efficiency of Chinese ports: a financial ratio-based data envelopment analysis approach.
Expert Syst. J. Knowl. Eng., 2010
A note on task assignment of several problems.
Comput. Ind. Eng., 2010
2009
A Note on Integer Programming Formulations of the Real-Time Optimal Scheduling and Flight Path Selection of UAVs.
IEEE Trans. Control. Syst. Technol., 2009
'Preventive maintenance scheduling of multi-cogeneration plants using integer programming'.
J. Oper. Res. Soc., 2009
Computationally attractive non-linear models for combinatorial optimisation.
Int. J. Math. Oper. Res., 2009
Solving the market split problem via branch-and-cut.
Int. J. Math. Model. Numer. Optimisation, 2009
Upper Bounding Service Capacity in Multihop Wireless SSMA-Based Ad Hoc Networks.
Proceedings of the Ad Hoc Networks, First International Conference, 2009
2008
Simple and fast surrogate constraint heuristics for the maximum independent set problem.
J. Heuristics, 2008
A new approach for modeling and solving set packing problems.
Eur. J. Oper. Res., 2008
Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis.
Commun. Stat. Simul. Comput., 2008
An Algorithm for Enhancing Spreadsheet Regression with Out-of-Sample Statistics.
Commun. Stat. Simul. Comput., 2008
A new modeling and solution approach for the set-partitioning problem.
Comput. Oper. Res., 2008
2007
An effective modeling and solution approach for the generalized independent set problem.
Optim. Lett., 2007
Solving the maximum edge weight clique problem via unconstrained quadratic programming.
Eur. J. Oper. Res., 2007
A Pseudo-Boolean Optimization for Multiple Criteria Decision Making in Complex Systems.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
2005
A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem.
Transp. Sci., 2005
Using <i>xQx</i> to model and solve the uncapacitated task allocation problem.
Oper. Res. Lett., 2005
Clustering of Microarray data via Clique Partitioning.
J. Comb. Optim., 2005
A new modeling and solution approach for the number partitioning problem.
Adv. Decis. Sci., 2005
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
Ann. Oper. Res., 2005
2004
A unified modeling and solution framework for combinatorial optimization problems.
OR Spectr., 2004
An Interactive Clustering Methodology for High Dimensional Data Mining.
Proceedings of the Pacific Asia Conference on Information Systems, 2004
Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining.
Proceedings of the 10th Americas Conference on Information Systems, 2004
2002
Dynamics of local search heuristics for the traveling salesman problem.
IEEE Trans. Syst. Man Cybern. Part A, 2002
Insights into two solution procedures for the single machine tardiness problem.
J. Oper. Res. Soc., 2002
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints.
Int. J. Inf. Technol. Decis. Mak., 2002
One-pass heuristics for large-scale unconstrained binary quadratic problems.
Eur. J. Oper. Res., 2002
2001
Greedy solutions of selection and ordering problems.
Eur. J. Oper. Res., 2001
1999
A tour construction heuristic for the travelling salesman problem.
J. Oper. Res. Soc., 1999
Scheduling with time dependent processing times: Review and extensions.
J. Oper. Res. Soc., 1999
1998
Global optimization for artificial neural networks: A tabu search application.
Eur. J. Oper. Res., 1998
1997
Computing orthogonal polynomials.
Comput. Oper. Res., 1997
Scheduling parallel machines to minimize total weighted and unweighted tardiness.
Comput. Oper. Res., 1997
1996
Scheduling on a Single Processor with Variable Speed.
Inf. Process. Lett., 1996
Scheduling deteriorating jobs on a single machine to minimize the maximum processing times.
Int. J. Syst. Sci., 1996
1994
Proof of permutationally convexity of MCSF games.
Math. Methods Oper. Res., 1994
1992
Maximizing set function formulation of two scheduling problems.
ZOR Methods Model. Oper. Res., 1992
Optimal assignment of NOP due-dates and sequencing in a single machine shop.
ZOR Methods Model. Oper. Res., 1992
1991
Single machine scheduling with nonlinear cost functions.
Comput. Oper. Res., 1991