Výsledky vyhledávání - "Polynomial and pseudo-polynomial time algorithms"

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Autoři: Aringhieri, Roberto Grosso, Andrea Hosteins, Pierre a další

Zdroj: Discrete Applied Mathematics. 253:103-121

Témata: Critical Node Problem, Connectivity measure, Shortest paths, Dynamic programming, Polynomial time algorithms, 0211 other engineering and technologies, Connectivity measure, Critical Node Problem, Dynamic programming, Polynomial time algorithms, Shortest paths, Discrete Mathematics and Combinatorics, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://iris.polito.it/handle/11583/2698736
https://iris.unito.it/handle/2318/1662827
https://dblp.uni-trier.de/db/journals/dam/dam253.html#AringhieriGHS19
https://www.sciencedirect.com/science/article/abs/pii/S0166218X18300039

OPTIMAL RESOURCE ALLOCATION MODEL FOR MULTI-FUNCTION RADAR ON NAVY WARSHIPS.

Autoři: Jinho Lee Wonseok Choi Duehee Lee a další

Zdroj: International Journal of Industrial Engineering; 2024, Vol. 31 Issue 5, p1117-1130, 14p

Témata: RADAR targets, RESOURCE allocation, CONCAVE functions, WARSHIPS, REGRESSION analysis

An Exact Approach for Multitasking Scheduling with Two Competitive Agents on Identical Parallel Machines.

Autoři: Xin, Xin Zhou, Suxia Gao, Jinsheng

Zdroj: Applied Sciences (2076-3417); Nov2025, Vol. 15 Issue 22, p12111, 27p

Témata: SCHEDULING, RESOURCE allocation, DEADLINES, COMPUTER multitasking, ALGORITHMS, PARALLEL computers, MANUFACTURING industries

Multitasking scheduling problems with two competitive agents.

Autoři: Li, Shi-Sheng Chen, Ren-Xia Tian, Ji

Zdroj: Engineering Optimization; Nov2020, Vol. 52 Issue 11, p1940-1956, 17p

Témata: POLYNOMIAL time algorithms, COST functions, PRODUCTION scheduling

Stochastic dynamic production planning in hybrid manufacturing and remanufacturing system with random usage durations.

Autoři: Cheng, Zhenxia

Zdroj: International Journal of Production Research; Apr2024, Vol. 62 Issue 7, p2331-2349, 19p

Témata: PRODUCTION planning, MANUFACTURING processes, HAZARD function (Statistics), DYNAMIC programming, RETURNS on sales

Optimizing two-agent single-machine parallel batch scheduling: achieving pareto efficiency in makespan and maximum cost objectives.

Autoři: Li, Shuguang Wei, Jing Sun, Yong a další

Zdroj: RAIRO: Operations Research (2804-7303); 2025, Vol. 59 Issue 4, p2219-2240, 22p

Témata: POLYNOMIAL time algorithms, PRODUCTION scheduling, ALGORITHMS

EVACUATION PLANNING PROBLEMS ON UNIFORM PATH LENGTH NETWORK WITH PRIORITIZED DESTINATIONS.

Autoři: BHANDARI, P. P. KHADKA, S. R.

Zdroj: TWMS Journal of Applied & Engineering Mathematics; 2025, Vol. 15 Issue 2, p363-376, 14p

Two-agent single machine scheduling with forbidden intervals.

Autoři: Feng, Qi Li, Shi-sheng Shang, Wei-ping

Zdroj: Applied Mathematics: A Journal of Chinese Universities; Mar2015, Vol. 30 Issue 1, p93-101, 9p

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times.

Autoři: Drótos, Márton Kis, Tamás

Zdroj: Journal of Scheduling; Jun2013, Vol. 16 Issue 3, p337-346, 10p

Témata: INVENTORIES, PRODUCTION scheduling, DELIVERY of goods, ALGORITHMS, BREAKDOWNS (Machinery)

On the complexity of the upgrading version of the maximal covering location problem.

Autoři: Baldomero‐Naranjo, Marta Kalcsics, Jörg Rodríguez‐Chía, Antonio M.

Zdroj: Networks; Jun2024, Vol. 83 Issue 4, p627-641, 15p

Témata: POLYNOMIAL time algorithms, NP-hard problems, INTEGERS, HYPERGRAPHS

Generalized maximum flow over time with intermediate storage.

Autoři: Dhamala, Tanka Nath Adhikari, Mohan Chandra Khanal, Durga Prasad a další

Zdroj: Annals of Operations Research; Apr2024, Vol. 335 Issue 1, p111-134, 24p

Témata: STORAGE, MATHEMATICAL models

Unrelated parallel batch processing machine scheduling for production systems under carbon reduction policies: NSGA-II and MOGWO metaheuristics.

Autoři: Fallahi, Ali Shahidi-Zadeh, Bahareh Niaki, Seyed Taghi Akhavan

Zdroj: Soft Computing - A Fusion of Foundations, Methodologies & Applications; Nov2023, Vol. 27 Issue 22, p17063-17091, 29p

Témata: BATCH processing, PARALLEL processing, PRODUCTION scheduling, SETUP time, METAHEURISTIC algorithms, CARBON emissions, INDUSTRIAL costs

Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives.

Autoři: Li, Shuguang Li, Mingsong Khan, Muhammad Ijaz

Zdroj: Networks & Heterogeneous Media; 2023, Vol. 18 Issue 4, p1-14, 14p

Témata: BATCH processing, TARDINESS, PRODUCTION scheduling, TIME complexity, SETUP time, PARETO optimum

Critical node/edge detection problems on trees.

Autoři: Di Summa, Marco Faruk, Syed Md Omar

Zdroj: 4OR (1619-4500); Sep2023, Vol. 21 Issue 3, p439-455, 17p

Iterated Regret Minimization in Game Graphs

Autoři: Filiot, Emmanuel Gall, Tristan Le Raskin, Jean-François

Témata: Computer Science - Computer Science and Game Theory, text

URL: http://arxiv.org/abs/1002.1456

Machine scheduling with job rejection and DeJong's learning effect.

Autoři: Gao, Jie Zou, Juan Cheng, Xiaoxuan

Zdroj: Mathematical Foundations of Computing; May2023, Vol. 6 Issue 2, p1-15, 15p

Témata: POLYNOMIAL time algorithms, SCHEDULING, PRODUCTION scheduling, MACHINERY

The loader problem: formulation, complexity and algorithms.

Autoři: Tang, G. Chen, F. Cheng, T. C. E. a další

Zdroj: Journal of the Operational Research Society; May2010, Vol. 61 Issue 5, p840-848, 9p

Témata: INTEGER programming, NP-complete problems, ALGORITHMS, MATHEMATICAL programming, POLYNOMIALS, COMPUTATIONAL complexity

Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations.

Autoři: Papazaharias, Demetrios V. Walteros, Jose L.

Zdroj: Mathematical Programming Computation; Mar2023, Vol. 15 Issue 1, p103-151, 49p

Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity.

Autoři: Wang, Du-Juan Yin, Yunqiang Liu, Mengqi

Zdroj: International Journal of Production Research; Jun2016, Vol. 54 Issue 12, p3691-3705, 15p

Témata: PRODUCTION control, RESOURCE allocation, PRODUCTION scheduling, SIMULATION methods & models, CONVEX functions, COMPUTATIONAL complexity, ELECTRONIC data processing

A heuristic approach for the distance-based critical node detection problem in complex networks.

Autoři: Alozie, Glory Uche Arulselvan, Ashwin Akartunalı, Kerem a další

Zdroj: Journal of the Operational Research Society; Jun2022, Vol. 73 Issue 6, p1347-1361, 15p

Témata: HEURISTIC algorithms, HEURISTIC, CENTRALITY, NEIGHBORHOODS