Results 41 to 50 of about 232 (135)

Mapping Quantum Computing Techniques for NP‐Hard Problems in Operations Management and Operations Research

open access: yesEngineering Reports, Volume 8, Issue 2, February 2026.
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad   +3 more
wiley   +1 more source

Is Computing with Light All You Need? A Perspective on Codesign for Optical Artificial Intelligence and Scientific Computing

open access: yesAdvanced Intelligent Systems, Volume 8, Issue 1, January 2026.
This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer   +6 more
wiley   +1 more source

Um modelo dinâmico de programação da frota e condutores aplicado ao transporte rodoviário regional de passageiros [PDF]

open access: yes, 2005
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Este trabalho tem foco no plano de operação de empresas de transporte rodoviário regional de passageiros, visando à ...
Pereira, Elaine Corrêa
core  

Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results

open access: yesSoftware: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.
ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley   +1 more source

Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation

open access: yes, 2000
In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core  

Workload equity in multiperiod vehicle routing problems

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 1, Page 245-267, January 2026.
Abstract An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload‐balance objectives or constraints, leading to trade‐off solutions between routing costs and workload equity.
Najmeh Nekooghadirli   +3 more
wiley   +1 more source

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

open access: yes, 2011
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong
Akartunali, Kerem   +7 more
core   +1 more source

Financial Portfolio Innovation via the Dhouib‐Matrix‐3 Metaheuristic

open access: yesApplied Computational Intelligence and Soft Computing, Volume 2026, Issue 1, 2026.
The portfolio optimization problem is a mathematical and financial decision‐making method that aims to achieve an optimal trade‐off between financial risk and return. This paper presents the first application of the novel metaheuristic Dhouib‐Matrix‐3 (DM3) to solve the portfolio optimization problem. DM3 is originally designed to address combinatorial
Souhail Dhouib   +5 more
wiley   +1 more source

Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations [PDF]

open access: yes, 2012
The traveling salesman problem (TSP) is the problem of finding a shortest Hamiltonian circuit or path in a given weighted graph. This problem has been studied in numerous variants, and linear programming has played an important role in the design of ...
An, Hyung Chan
core  

Study on Quantum Approximation Optimization Algorithm in Airport Cargo Transportation Problem

open access: yesJournal of Advanced Transportation, Volume 2026, Issue 1, 2026.
The vehicle routing problem (VRP) is a core NP‐hard combinatorial optimization problem in logistics and supply chain management. Quantum computing, particularly the Quantum Approximate Optimization Algorithm (QAOA), is being explored as a promising heuristic tool for tackling such problems.
Xudong Zhao   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy