A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes by A. N. Maksimenko

Subjects: “…np-hard problems…”
Get full text

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem by Kenichi Morita, Chuzo Iwamoto, Kento Sasaki

Subjects: Get full text

The computational complexity of the gear placement problem by Vitor Mitsuo FUKUSHIGUE HAMA, Shogo KANAZAWA, Yannan HU, Shinji IMAHORI, Hirotaka ONO, Mutsunori YAGIURA

Subjects: Get full text

Passive Location Resource Scheduling Based on an Improved Genetic Algorithm by Jianjun Jiang, Jing Zhang, Lijia Zhang, Xiaomin Ran, Yanqun Tang

Subjects: Get full text

A Cooperation-Based Caching Scheme for Heterogeneous Networks by Junchao Ma, Jiahuan Wang, Pingzhi Fan

Subjects: Get full text

Connectivity problems on heterogeneous graphs by Jimmy Wu, Alex Khodaverdian, Benjamin Weitz, Nir Yosef

Subjects: Get full text

Optimal Cooperative Offloading Scheme for Energy Efficient Multi-Access Edge Computation by Joseph Henry Anajemba, Tang Yue, Celestine Iwendi, Mamdouh Alenezi, Mohit Mittal

Subjects: Get full text

Uniform Workload Distribution Problems by Peter Czimmermann, Stefan Pesko, Jan Cerny

Subjects: Get full text

Polyhedral Characteristics of Balanced and Unbalanced Bipartite Subgraph Problems by Vladimir Bondarenko, Andrei Nikolaev, Dzhambolet Shovgenov

Subjects: Get full text

GRASP Optimization for the Strip Packing Problem with Flags, Waste Functions, and an Improved Restricted Candidate List by Edgar Oviedo-Salas, Jesús David Terán-Villanueva, Salvador Ibarra-Martínez, Alejandro Santiago-Pineda, Mirna Patricia Ponce-Flores, Julio Laria-Menchaca, José Antonio Castán-Rocha, Mayra Guadalupe Treviño-Berrones

Subjects: Get full text

SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM by M. K. Marichelvam, M. Geetha

Subjects: Get full text

El problema del viajante de comercio: Búsqueda de soluciones y herramientas asequibles by García Bernal, Juan Jesús, Hontoria Hernández, Eloy, Aleksovski, Darko

Subjects: Get full text

NEW HEURISTICS FOR MINIMISING TOTAL COMPLETION TIME AND THE NUMBER OF TARDY JOBS CRITERIA ON A SINGLE MACHINE WITH RELEASE TIME by E. O. Oyetunji, A. E. Oluleye

Subjects: “…NP-Hard…”
Get full text

Engineering Design under Imprecise Probabilities: Computational Complexity by Vladik Kreinovich

Subjects: Get full text

A Discrete Improved Artificial Bee Colony Algorithm for 0–1 Knapsack Problem by Song Zhang, Sanyang Liu

Subjects: Get full text

Performance Analysis of the (1+1) EA on Mobile Robot Path Planning by Xinsheng Lai, Yulin Feng

Subjects: Get full text

Multi-Qubit Bose–Einstein Condensate Trap for Atomic Boson Sampling by Sergey Tarasov, William Shannon, Vladimir Kocharovsky, Vitaly Kocharovsky

Subjects: Get full text

SIESTA: enhancing searches for optimal supertrees and species trees by Pranjal Vachaspati, Tandy Warnow

Subjects: Get full text

Towards the Simplest Model of Quantum Supremacy: Atomic Boson Sampling in a Box Trap by Vitaly V. Kocharovsky, Vladimir V. Kocharovsky, William D. Shannon, Sergey V. Tarasov

Subjects: Get full text

A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques by Shirley Xu, David Perkins

Subjects: Get full text