Works matching DE "KNAPSACK problems"

Results: 877

Küme Birleşimli Sırt Çantası Probleminin Adaptif Yapay Arı Kolonisi Algoritması ile Çözümü.

Published in:

Journal of Intelligent Systems: Theory & Applications, 2021, v. 4, n. 1, p. 43, doi. 10.38016/jista.854584

By:

DURGUT, Rafet;
YAVUZ, İlim Betül;
AYDIN, Mehmet Emin

Publication type:

Article

自适应复合转换函数的二进制电鳗觅食优化算法.

Published in:

Journal of Computer Engineering & Applications, 2025, v. 61, n. 12, p. 107, doi. 10.3778/j.issn.1002-8331.2407-0068

By:

李牧元;
刘建华;
力尚龙;
吴炳南

Publication type:

Article

Guest Editorial Special Issue on the Next-Generation Deep Learning Approaches to Emerging Real-World Applications.

Published in:

2025

By:

Zhou, Yu;
Osaba, Eneko;
Zhang, Xiao

Publication type:

Editorial

Reinforcement Learning for Solving the Knapsack Problem.

Published in:

Computers, Materials & Continua, 2025, v. 84, n. 1, p. 919, doi. 10.32604/cmc.2025.062980

By:

Zhang, Zhenfu;
Yin, Haiyan;
Zuo, Liudong;
Lai, Pan

Publication type:

Article

Special Issue on "Cutting and Packing".

Published in:

International Transactions in Operational Research, 2025, v. 32, n. 6, p. 4044, doi. 10.1111/itor.70035

By:

Moura, Ana;
Ramos, António Galrão;
Silva, Elsa;
Oliveira, José Fernando

Publication type:

Article

Good Prophets Know When the End Is Near.

Published in:

Management Science, 2025, v. 71, n. 6, p. 4877, doi. 10.1287/mnsc.2023.04307

By:

Banerjee, Siddhartha;
Freund, Daniel

Publication type:

Article

A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem.

Published in:

Algorithms, 2025, v. 18, n. 5, p. 295, doi. 10.3390/a18050295

By:

Zheng, Fuyuan;
Cheng, Kanglong;
Yang, Kai;
Li, Ning;
Lin, Yu;
Zhong, Yiwen

Publication type:

Article

A simple and efficient attack on the Merkle-Hellman knapsack cryptosystem.

Published in:

PLoS ONE, 2025, v. 20, n. 5, p. 1, doi. 10.1371/journal.pone.0322726

By:

Bi, Jingguo;
Su, Lei;
Peng, Haipeng;
Wang, Lin

Publication type:

Article

ADVCSO: Adaptive Dynamically Enhanced Variant of Chicken Swarm Optimization for Combinatorial Optimization Problems.

Published in:

Biomimetics (2313-7673), 2025, v. 10, n. 5, p. 303, doi. 10.3390/biomimetics10050303

By:

Wu, Kunwei;
Wang, Liangshun;
Liu, Mingming

Publication type:

Article

On Bilevel Optimization with Inexact Follower.

Published in:

Decision Analysis, 2020, v. 17, n. 1, p. 74, doi. 10.1287/deca.2019.0392

By:

Zare, M. Hosein;
Prokopyev, Oleg A.;
Sauré, Denis

Publication type:

Article

An enhanced genetic algorithm for constrained knapsack problems in dynamic environments.

Published in:

Natural Computing, 2019, v. 18, n. 4, p. 913, doi. 10.1007/s11047-018-09725-3

By:

Qian, Shuqu;
Liu, Yanmin;
Ye, Yongqiang;
Xu, Guofeng

Publication type:

Article

Evolution of new algorithms for the binary knapsack problem.

Published in:

Natural Computing, 2016, v. 15, n. 1, p. 181, doi. 10.1007/s11047-015-9483-8

By:

Parada, Lucas;
Herrera, Carlos;
Sepúlveda, Mauricio;
Parada, Víctor

Publication type:

Article

A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem.

Published in:

Natural Computing, 2016, v. 15, n. 1, p. 153, doi. 10.1007/s11047-014-9470-5

By:

Haddar, Boukthir;
Khemakhem, Mahdi;
Rhimi, Hamza;
Chabchoub, Habib

Publication type:

Article

A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning.

Published in:

Machine Learning, 2022, v. 111, n. 4, p. 1551, doi. 10.1007/s10994-021-06109-0

By:

Hajdu, András;
Terdik, György;
Tiba, Attila;
Tomán, Henrietta

Publication type:

Article

A new effective dynamic program for an investment optimization problem.

Published in:

Automation & Remote Control, 2016, v. 77, n. 9, p. 1633, doi. 10.1134/S0005117916090101

By:

Gafarov, E.;
Dolgui, A.;
Lazarev, A.;
Werner, F.

Publication type:

Article

The network programming method in control over target programs.

Published in:

Automation & Remote Control, 2014, v. 75, n. 3, p. 470, doi. 10.1134/S0005117914030059

By:

Burkov, V.;
Burkova, I.

Publication type:

Article

Optimal working time distribution and routing for autonomous tractors based on heuristic algorithms.

Published in:

Automation & Remote Control, 2013, v. 74, n. 9, p. 1486, doi. 10.1134/S0005117913090051

By:

Gutman, P. -O.;
Ioslovich, I.

Publication type:

Article

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method.

Published in:

Automation & Remote Control, 2010, v. 71, n. 10, p. 2152, doi. 10.1134/S0005117910100140

By:

Kolpakov, R. M.;
Posypkin, M. A.;
Sigal, I. Kh.

Publication type:

Article

Graphic approach to combinatorial optimization.

Published in:

Automation & Remote Control, 2007, v. 68, n. 4, p. 583, doi. 10.1134/S0005117907040029

By:

Lazarev, A.

Publication type:

Article

EASILY COMPUTABLE FACETS OF THE KNAPSACK POLYTOPE.

Published in:

Mathematics of Operations Research, 1989, v. 14, n. 4, p. 760, doi. 10.1287/moor.14.4.760

By:

Zemel, Eitan

Publication type:

Article

PROBABILISTIC ANALYSIS OF THE MULTIDIMENSIONAL KNAPSACK PROBLEM.

Published in:

Mathematics of Operations Research, 1989, v. 14, n. 1, p. 162, doi. 10.1287/moor.14.1.162

By:

Dyer, M. E.;
Frieze, A. M.

Publication type:

Article

LOWER BOUNDS ON TIME-ACCURACY TRADE-OFFS FOR THE 0-1 KNAPSACK PROBLEM.

Published in:

Mathematics of Operations Research, 1988, v. 13, n. 3, p. 497, doi. 10.1287/moor.13.3.497

By:

Peters, Joseph G.

Publication type:

Article

A NOTE ON APPROXIMATION SCHEMES FOR MULTIDIMENSIONAL KNAPSACK PROBLEMS.

Published in:

Mathematics of Operations Research, 1984, v. 9, n. 2, p. 244, doi. 10.1287/moor.9.2.244

By:

Magazine, Michael J.;
Chern, Maw-Sheng

Publication type:

Article

ON KNAPSACKS, PARTITIONS, AND A NEW DYNAMIC PROGRAMMING TECHNIQUE FOR TREES.

Published in:

Mathematics of Operations Research, 1983, v. 8, n. 1, p. 1, doi. 10.1287/moor.8.1.1

By:

Johnson, D. S.;
Niemi, K. A.

Publication type:

Article

MAXIMISING REAL-VALUED SUBMODULAR FUNCTIONS: PRIMAL AND DUAL HEURISTICS FOR LOCATION PROBLEMS.

Published in:

Mathematics of Operations Research, 1982, v. 7, n. 3, p. 410, doi. 10.1287/moor.7.3.410

By:

Wolsey, Laurence A.

Publication type:

Article

EXPONENTIAL LOWER BOUNDS ON A CLASS OF KNAPSACK ALGORITHMS.

Published in:

Mathematics of Operations Research, 1981, v. 6, n. 2, p. 225, doi. 10.1287/moor.6.2.225

By:

Hausmann, Dirk;
Kannan, Ravindran;
Korte, Bernhard

Publication type:

Article

CIRCULAR CUTS IN A NETWORK.

Published in:

Mathematics of Operations Research, 1980, v. 5, n. 3, p. 422, doi. 10.1287/moor.5.3.422

By:

Hu, T. C.;
F., Ruskey

Publication type:

Article

FAST APPROXIMATION ALGORITHMS FOR KNAPSACK PROBLEMS.

Published in:

Mathematics of Operations Research, 1979, v. 4, n. 4, p. 339, doi. 10.1287/moor.4.4.339

By:

Lawler, Eugene L.

Publication type:

Article

COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS.

Published in:

Mugla Journal of Science & Technology, 2019, v. 5, n. 1, p. 34, doi. 10.22531/muglajsci.469475

By:

DURMUŞ, Burcu;
İŞÇİ GÜNERİ, Öznur;
İNCEKIRIK, Aynur

Publication type:

Article

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem.

Published in:

Cogent Engineering, 2015, v. 2, n. 1, p. 1, doi. 10.1080/23311916.2015.1068969

By:

Hifi, Mhand;
Saleh, Sagvan;
Wu, Lei

Publication type:

Article

Lagrangian based approach to solve a two level capacitated lot sizing problem.

Published in:

Cogent Engineering, 2015, v. 2, n. 1, p. 1, doi. 10.1080/23311916.2015.1008861

By:

Verma, Mayank;
Sharma, R.R.K.

Publication type:

Article

An exact constructive algorithm for the knapsack sharing problem.

Published in:

Optimization Methods & Software, 2017, v. 32, n. 5, p. 1078, doi. 10.1080/10556788.2016.1240795

By:

Mhalla, Hedi

Publication type:

Article

A note on semidefinite relaxation for 0-1 quadratic knapsack problems.

Published in:

Optimization Methods & Software, 2013, v. 28, n. 4, p. 930, doi. 10.1080/10556788.2011.627586

By:

Zheng, Xiaojin;
Sun, Xiaoling;
Li, Duan

Publication type:

Article

Minimum Energy Utilization Strategy for Fleet of Autonomous Robots in Urban Waste Management.

Published in:

Robotics, 2023, v. 12, n. 6, p. 159, doi. 10.3390/robotics12060159

By:

Justo, Valeria Bladinieres;
Gupta, Abhishek;
Umland, Tobias Fritz;
Göhlich, Dietmar

Publication type:

Article

Performance Analysis of Multiple Knapsack Problem Optimization Algorithms: A Comparative Study for Retail and SME Applications.

Published in:

Ingénierie des Systèmes d'Information, 2025, v. 30, n. 2, p. 533, doi. 10.18280/isi.300224

By:

Santoso, Dewi Agustini;
Rizqa, Ifan;
Aqmala, Diana;
Alzami, Farrikh;
Rijati, Nova;
Marjuni, Aris

Publication type:

Article

面向数据采集的多无人机协同节能部署方法.

Published in:

Telecommunication Engineering, 2022, v. 62, n. 10, p. 1419, doi. 10.3969/j.issn.1001-893x.2022.10.006

By:

袁进;
王海;
秦蓁;
李艾静

Publication type:

Article

Develop an optimal washing and care mode for knapsack.

Published in:

Journal of Industrial Textiles, 2023, p. 1, doi. 10.1177/15280837221149216

By:

Wei, Yuhui;
Cao, Xuejiao;
Huang, Yuxuan;
Su, Zhaowei;
Wang, Peng;
Wang, Zongqian;
Wang, Kaifa

Publication type:

Article

Develop an optimal washing and care mode for knapsack.

Published in:

Journal of Industrial Textiles, 2023, v. 53, p. 1, doi. 10.1177/15280837221149216

By:

Yuhui Wei;
Xuejiao Cao;
Yuxuan Huang;
Zhaowei Su;
Peng Wang;
Zongqian Wang;
Kaifa Wang

Publication type:

Article

Develop an optimal washing and care mode for knapsack.

Published in:

Journal of Industrial Textiles, 2022, v. 52, p. 1, doi. 10.1177/15280837221149216

By:

Wei, Yuhui;
Cao, Xuejiao;
Huang, Yuxuan;
Su, Zhaowei;
Wang, Peng;
Wang, Zongqian;
Wang, Kaifa

Publication type:

Article

Generating Functions in the Knapsack Problem.

Published in:

Doklady Mathematics, 2018, v. 98, n. 1, p. 364, doi. 10.1134/S1064562418050198

By:

Leontiev, V. K.;
Gordeev, E. N.

Publication type:

Article

Optimization of a Multi-Item Inventory model for deteriorating items with capacity constraint using dynamic programming.

Published in:

Journal of Industrial & Management Optimization, 2022, v. 18, n. 2, p. 1145, doi. 10.3934/jimo.2021013

By:

Karimi, Mahdi;
Sadjadi, Seyed Jafar

Publication type:

Article

A CONIC APPROXIMATION METHOD FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM.

Published in:

Journal of Industrial & Management Optimization, 2013, v. 9, n. 3, p. 531, doi. 10.3934/jimo.2013.9.531

By:

JING ZHOU;
DEJUN CHEN;
ZHENBO WANG;
WENXUN XING

Publication type:

Article

PORTFOLIO MANAGEMENT AND THE SHRINKING KNAPSACK ALGORITHM.

Published in:

Journal of Financial & Quantitative Analysis, 1979, v. 14, n. 5, p. 1071, doi. 10.2307/2330308

By:

Stone, Bernell K.;
Hill, Ned C.

Publication type:

Article

Incorporating travel time means and standard deviations into transportation network design problem: a hybrid method based on column generation and Lagrangian relaxation.

Published in:

Transportation Letters, 2024, v. 16, n. 2, p. 131, doi. 10.1080/19427867.2023.2166212

By:

Song, Maocan;
Cheng, Lin

Publication type:

Article

Optimization in Mineral Processing: A Novel Matheuristic for a Variant of the Knapsack Problem.

Published in:

Minerals (2075-163X), 2025, v. 15, n. 4, p. 427, doi. 10.3390/min15040427

By:

Leiva, Carlos;
Lespay, Hernán;
Quelopana, Aldo;
Navarra, Alessandro

Publication type:

Article

COMBINED ALGORITHMS FOR DETERMINING THE INITIAL SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS.

Published in:

Informatics & Mathematical Methods in Simulation / Informatika ta Matematičnì Metodi v Modelûvannì, 2023, v. 13, n. 1/2, p. 162, doi. 10.15276/imms.v13.no1-2.162

By:

Yukhimenko, B. I.;
Volkova, N. H.;
Kozina, Yu. Yu.

Publication type:

Article

A GENERAL CONSTRUCTION FOR MONOID-BASED KNAPSACK PROTOCOLS.

Published in:

Advances in Mathematics of Communications, 2014, v. 8, n. 3, p. 343, doi. 10.3934/amc.2014.8.343

By:

MICHELI, GIACOMO;
SCHIAVINA, MICHELE

Publication type:

Article

Human Behavior in Project Portfolio Selection: Insights from an Experimental Study.

Published in:

Decision Sciences, 2018, v. 49, n. 6, p. 1061, doi. 10.1111/deci.12310

By:

Schiffels, Sebastian;
Fliedner, Thomas;
Kolisch, Rainer

Publication type:

Article

A note on a two dimensional knapsack problem with unloading constraints.

Published in:

RAIRO - Theoretical Informatics & Applications, 2013, v. 47, n. 4, p. 315, doi. 10.1051/ita/2013037

By:

Moisés da Silveira, Jefferson Luiz;
Xavier, Eduardo Candido;
Miyazawa, Flávio Keidi

Publication type:

Article

A NOTE ON DUAL APPROXIMATION ALGORITHMS FOR CLASS CONSTRAINED BIN PACKING PROBLEMS.

Published in:

RAIRO - Theoretical Informatics & Applications, 2009, v. 43, n. 2, p. 239, doi. 10.1051/ita:2008027

By:

Xavier, Eduardo C.;
Miyazawa, Fàvio Keidi

Publication type:

Article