|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 710 occurrences of 401 keywords
|
|
|
Results
Found 2811 publication records. Showing 2811 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Gregory B. Sorkin |
Some Notes on Random Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings, pp. 117-130, 2001, Springer, 3-540-43025-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Lucian Ilie, Arto Salomaa |
On the Expressiveness of Subset-Sum Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 36(8), pp. 665-672, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Pankaj Batra |
Modeling and efficient optimization for object-based scalability and some related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 9(10), pp. 1677-1692, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh |
A Performance Model of Speculative Prefetching in Distributed Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS/SPDP ![In: 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings, pp. 75-80, 1999, IEEE Computer Society, 0-7695-0143-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Phong Q. Nguyen, Jacques Stern |
Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings, pp. 213-218, 1998, Springer, 3-540-65894-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Laureano F. Escudero, Silvano Martello, Paolo Toth |
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 110-123, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Glenn A. Orton |
A Multiple-Iterated Trapdoor for Dense Compact Knapsacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, pp. 112-130, 1994, Springer, 3-540-60176-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | J. C. Lagarias 0001, Andrew M. Odlyzko |
Solving Low-Density Subset Sum Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(1), pp. 229-246, January 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Shimon Even, Yacov Yacobi |
Cryptocomplexity and NP-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings, pp. 195-207, 1980, Springer, 3-540-10003-2. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
18 | Lena Chang, James F. Korsh |
Canonical Coin Changing and Greedy Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 23(3), pp. 418-422, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
15 | Ole-Christoffer Granmo, B. John Oommen |
Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(4), pp. 545-560, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Nonlinear knapsack problems, resource allocation, stochastic optimization, learning automata, hierarchical learning |
15 | Wu Jigang, Thambipillai Srikanthan, Guang Chen |
Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(4), pp. 532-544, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
algorithm, complexity, heuristic, knapsack problem, Hardware/software partitioning |
15 | Nattavut Wiriyasermkul, Veera Boonjing, Pisit Chanvarasuth |
A Meiosis Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Seventh International Conference on Information Technology: New Generations, ITNG 2010, Las Vegas, Nevada, USA, 12-14 April 2010, pp. 285-289, 2010, IEEE Computer Society, 978-0-7695-3984-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Meiosis Genetic Algorithm, Genetic Algorithm, Knapsack Problem |
15 | Maxwell Walton, Gary Gréwal, Gerarda A. Darlington |
Parallel FPGA-based implementation of scatter search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 1075-1082, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
0-1 knapsack problem, field programmable gate arrays, pipelining, hardware acceleration, data parallelism, scatter search |
15 | András Prékopa, Csaba I. Fábián |
Cutting-Stock Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 594-595, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cutting pattern, Knapsack problem, Column generation, Cutting-stock problem |
15 | Hans van Maaren |
Simplicial Pivoting Algorithms for Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 3585-3591, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Simplicial algorithms, Horn formulas, Integer programming, Knapsack problem |
15 | Stephen A. Vavasis |
Complexity Theory: Quadratic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 451-454, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Trust region problem, Strongly polynomial time, Simplicial constraints, Box constraints, Ellipsoid method, Approximation algorithms, Complexity, NP-complete, NP-hard, Quadratic programming, Polynomial time, Knapsack problem, Interior point methods, Local minimization |
15 | Kalyan Kuppuswamy, Daniel C. Lee 0001 |
An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(2), pp. 658-670, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
knapsack approximation, multiclass fixed-point approximation, optical WDM networks, performance evaluation, blocking probability, loss networks |
15 | Matteo Fischetti, Michele Monaci |
Light Robustness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robust and Online Large-Scale Optimization ![In: Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, pp. 61-84, 2009, Springer, 978-3-642-05464-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multi-dimensional Knapsack, Train Timetabling, Integer Linear Programming, Stochastic Programming, Robust optimization |
15 | Xiaofang Zhang, Huamao Shan, Ju Qian |
Resource-Aware Test Suite Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSIC ![In: Proceedings of the Ninth International Conference on Quality Software, QSIC 2009, Jeju, Korea, August 24-25, 2009, pp. 341-346, 2009, IEEE Computer Society, 978-0-7695-3828-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
test suite optimization, 0-1 knapsack, regression testing, resource-aware |
15 | Tomohiro Shintani, Ryuichi Sakai |
Cryptanalysis on 2 Dimensional Subset-sum Public Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1466-1469, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
knapsack public key cryptosystem, cryptanalysis, lattice, shortest vector problem |
15 | Christian Klamler, Ulrich Pferschy, Stefan Ruzika |
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADT ![In: Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings, pp. 50-61, 2009, Springer, 978-3-642-04427-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
knapsack constraint, committee selection |
15 | Shamik Sengupta, Mainak Chatterjee |
Designing Auction Mechanisms for Dynamic Spectrum Access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 13(5), pp. 498-515, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dynamic spectrum access (DSA), auctions, cognitive radio, knapsack, winner determination |
15 | Lucian Prodan, Mihai Udrescu, Mircea Vladutiu |
Fault-Tolerant Memory Design and Partitioning Issues in Embryonics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICES ![In: Evolvable Systems: From Biology to Hardware, 8th International Conference, ICES 2008, Prague, Czech Republic, September 21-24, 2008. Proceedings, pp. 372-381, 2008, Springer, 978-3-540-85856-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithms, fault tolerance, reliability, partitioning, memory architecture, knapsack problem, Embryonics |
15 | Terence Kelly, Andrew Byde |
Generating k-best solutions to auction winner determination problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGecom Exch. ![In: SIGecom Exch. 6(1), pp. 23-34, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
decision support, auctions, knapsack problems, procurement, preference elicitation, k-shortest paths |
15 | Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli 0001 |
A "maximum node clustering" problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(4), pp. 373-385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Maximum Node Clustering, Complexity, Approximation, Knapsack |
15 | Aynur Kahraman, H. Aydolu Seven |
Healthy daily meal planner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Workshops ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Workshop Proceedings, Washington DC, USA, June 25-26, 2005, pp. 390-393, 2005, ACM. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
diet problem, multi-objective multi-constrained knapsack problem, genetic algorithms, multi-objective optimization |
15 | Maria A. Osorio, German Cuaya-Simbro |
Hard Problem Generation for MKP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ENC ![In: Sixth Mexican International Conference on Computer Science (ENC 2005), 26-30 September 2005, Puebla, Mexico, pp. 290-297, 2005, IEEE Computer Society, 0-7695-2454-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Multdimensional Knapsack Problem, Hard Problems Generation, Integer Programming |
15 | Jan Cosyn, Karl Sigman |
Stochastic Networks: Admission and Routing Using Penalty Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 48(3-4), pp. 237-262, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
exponential penalty, stochastic knapsack, admission control, routing control |
15 | Eduardo Conde |
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 100(2), pp. 345-353, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
complexity, knapsack problem, robust optimization, polynomial algorithm |
15 | Athanassios Boulis, Mani B. Srivastava |
Node-Level Energy Management for Sensor Networks in the Presence of Multiple Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 10(6), pp. 737-746, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
distributed mobile applications, dynamic and stochastic knapsack problem, sensor networks, admission control, energy management |
15 | Meinolf Sellmann, Torsten Fahle |
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 118(1-4), pp. 17-33, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum weighted stable set constraint, knapsack constraint, Lagrangian relaxation, optimization constraint |
15 | Johannes Merkle |
Multi-round passive attacks on server-aided RSA protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: CCS 2000, Proceedings of the 7th ACM Conference on Computer and Communications Security, Athens, Greece, November 1-4, 2000., pp. 102-107, 2000, ACM, 1-58113-203-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
server aided secret computations, digital signatures, RSA, knapsack problem |
15 | Gary Valentin, Michael Zuliani, Daniel C. Zilio, Guy M. Lohman, Alan Skelley |
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28 - March 3, 2000, pp. 101-110, 2000, IEEE Computer Society, 0-7695-0506-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Index Selection, Knapsack Algorithm, Optimizer, Relational Database, Database Design, Self-Tuning, Auto-Tuning, Wizard |
15 | Paul Camion, Hervé Chabanne |
On the Powerline System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 9(5), pp. 405-432, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Chor-Rivest, Powerline, Fractional Powerline, Quadratic Fractional Power System, Berlekamp-Massey, RSA, Identification, Public Key Cryptosystem (PKC), Knapsack |
15 | Reuven Bar-Yehuda |
Using Homogenous Weights for Approximating the Partial Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA., pp. 71-75, 1999, ACM/SIAM, 0-89871-434-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering |
15 | Chi-Sung Laih, Min-Jea Gau |
Cryptanalysis if a Diophantine Equation Oriented Public Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 46(4), pp. 511, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
knapsack cryptosystem, cryptography, cryptanalysis, Public keys |
15 | Naoyuki Kubota, Toshio Fukuda |
Genetic algorithms with age structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 1(4), pp. 155-161, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Age Structure, Genetic Algorithm, Optimization, Knapsack Problem |
15 | Kequin Li |
Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 33th Annual Southeast Regional Conference, 1995, Clemson, South Carolina, USA, March 17-18, 1995, pp. 219-226, 1995, ACM, 978-0-89791-747-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
maximum subset sum, multiprogrammed parallel system, sequential selection, approximation algorithm, probabilistic analysis, knapsack, recurrence relations |
15 | David Eppstein |
Finding the k Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 154-165, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths |
12 | Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White |
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 162, pp. 106477, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Dung T. K. Ha, Canh V. Pham, Tan D. Tran |
Improved approximation algorithms for k-submodular maximization under a knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 161, pp. 106452, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang, Qinghua Wu 0002 |
An effective hybrid search method for the quadratic knapsack problem with conflict graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 75(5), pp. 1000-1010, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Ahmed Noaman Karar, Ashraf Labib, Dylan Jones |
A resilience-based maintenance optimisation framework using multiple criteria and Knapsack methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Eng. Syst. Saf. ![In: Reliab. Eng. Syst. Saf. 241, pp. 109674, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Samah Boukhari, Mhand Hifi |
Combining local branching and descent method for solving the multiple-choice knapsack problem with setups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 31(1), pp. 29-52, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Malek Masmoudi, Yassine Adouani, Bassem Jarboui |
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 31(3), pp. 1890-1916, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev |
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 18(1), pp. 73-103, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Minami Sato, Sosuke Minamoto, Ryuichi Sakai, Yasuyuki Murakami |
High-Density Knapsack Cryptosystem Using Shifted-Odd and Super-Increasing Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3), pp. 519-522, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Yann Disser, Max Klimm, Annette Lutz, David Weckbecker |
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 38(1), pp. 764-789, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001 |
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 984, pp. 114320, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Jiaxi Wu, Wenquan Yang, Xinming Han, Yunzhe Qiu, Andrei Gudkov, Jie Song 0002 |
Hotspot resolution in cloud computing: A Γ-robust knapsack approach for virtual machine migration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 186, pp. 104817, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Yang Yang |
An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.11307, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Peyman Khezr, Vijay Mohan, Lionel Page |
Strategic Bidding in Knapsack Auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.07928, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Moritz Buchem, Paul Deuker, Andreas Wiese |
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.00536, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Jonathan Goohs, Georgel Savin, Lucas Starks, Josiah Dykstra, William Casey |
Adversarial Knapsack and Secondary Effects of Common Information for Cyber Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.10789, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Junyoung Kim, Kyungsik Lee |
Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.06686, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Jihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho Yoon |
Optimal Mechanism in a Dynamic Stochastic Knapsack Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.14269, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Yang Yang |
A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.11320, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Saleh Vahdatpour |
Addressing The Knapsack Challenge Through Cultural Algorithm Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.03324, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Kentaro Ohno, Tatsuhiko Shirai, Nozomu Togawa |
Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.19175, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Ivan Sergeev |
On contention resolution for the hypergraph matching, knapsack, and k-column sparse packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.00041, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Kilian Grage, Klaus Jansen |
Convolution and Knapsack in Higher Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.16117, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Guilherme Dias da Fonseca, Yan Gerard |
Shadoks Approach to Knapsack Polygonal Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.20123, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Santini, Enrico Malaguti |
The min-Knapsack problem with compactness constraints and applications in statistics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 312(1), pp. 385-397, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Florette Martinez |
A Variation on Knellwolf and Meier's Attack on the Knapsack Generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2024, pp. 485, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
12 | Dipayan Das 0001, Antoine Joux |
Key Recovery Attack on the Partial Vandermonde Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2024, pp. 366, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
12 | Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 4828-4848, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Shuang Cui, Kai Han 0003, He Huang |
Deletion-Robust Submodular Maximization with Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 11695-11703, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Jihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho Yoon |
Optimal Mechanism in a Dynamic Stochastic Knapsack Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 9807-9814, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Zhen Song, Wenjian Luo, Peilan Xu, Zipeng Ye, Kesheng Chen |
An Indicator Based Evolutionary Algorithm for Multiparty Multiobjective Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intelligent Information Processing (1) ![In: Intelligent Information Processing XII - 13th IFIP TC 12 International Conference, IIP 2024, Shenzhen, China, May 3-6, 2024, Proceedings, Part I, pp. 233-246, 2024, Springer, 978-3-031-57807-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Dipayan Das 0001, Antoine Joux |
Key Recovery Attack on the Partial Vandermonde Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (6) ![In: Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part VI, pp. 205-225, 2024, Springer, 978-3-031-58750-4. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith |
Removable Online Knapsack and Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 18:1-18:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Matthias Gehnen, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Bounded Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 37:1-37:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Qizheng He, Zhean Xu |
Simple and Faster Algorithms for Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024, pp. 56-62, 2024, SIAM, 978-1-61197-793-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Marzan Binte Abid, Shuvo Shaha, Upama Kabir, Md. Fahim Arefin |
Parallelized 0/1 Knapsack Algorithm Optimization in CPU-GPU-Based Heterogeneous System with Algorithm-based Fault Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMCOM ![In: 18th International Conference on Ubiquitous Information Management and Communication, IMCOM 2024, Kuala Lumpur, Malaysia, January 3-5, 2024, pp. 1-8, 2024, IEEE, 979-8-3503-3101-1. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Palash Dey, Sudeshna Kolay, Sipra Singh |
Knapsack: Connectedness, Path, and Shortest-Path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN (2) ![In: LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II, pp. 162-176, 2024, Springer, 978-3-031-55600-5. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Laurent Gourvès, Aris Pagourtzis |
Removable Online Knapsack with Bounded Size Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings, pp. 283-296, 2024, Springer, 978-3-031-52112-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
12 | Karam M. Sallam, Amr A. Abohany, Rizk Masoud Rizk-Allah |
Correction to: An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(24), pp. 18089, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Méziane Aïder, Oussama Gacem, Mhand Hifi |
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(2), pp. 1183-1209, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Karam M. Sallam, Amr A. Abohany, Rizk M. Rizk-Allahi |
An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(18), pp. 13359-13386, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yan Kang 0003, Haining Wang, Bin Pu, Jiansong Liu, Shin-Jye Lee, Xuekun Yang, Liu Tao |
TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(17), pp. 12691-12713, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yan Kang 0003, Haining Wang, Bin Pu, Jiansong Liu, Shin-Jye Lee, Xuekun Yang, Liu Tao |
Correction to: TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(17), pp. 12715, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Qiang Luo, Yunqing Rao |
Heuristic algorithms for the special knapsack packing problem with defects arising in aircraft arrangement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 215, pp. 119392, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jingjing Tan, Ruiqi Yang, Yapu Zhang, Mingyue Zhu |
Streaming Algorithms for Non-Submodular Functions Maximization with d-Knapsack Constraint on the Integer Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 40(5), pp. 2340018:1-2340018:16, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ao Zhao, Qian Liu, Yang Zhou 0018, Min Li |
Approximation Algorithms for Matroid and Knapsack Means Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 40(1), pp. 2240007:1-2240007:16, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Imen Ben Mansour |
An Effective Hybrid Ant Colony Optimization for the Knapsack Problem Using Multi-Directional Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SN Comput. Sci. ![In: SN Comput. Sci. 4(2), pp. 164, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer |
Knapsack problems with position-dependent item weights or profits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 326(1), pp. 137-156, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Seulgi Joung, Seyoung Oh, Kyungsik Lee |
Comparative analysis of linear programming relaxations for the robust knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 323(1), pp. 65-78, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Moses Ganardi, Markus Lohrey, Georg Zetzsche |
Knapsack and the power word problem in solvable Baumslag-Solitar groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 33(3), pp. 617-639, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yasmine Beck, Ivana Ljubic, Martin Schmidt 0003 |
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 15(4), pp. 733-782, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Shaoze Li, Zhibin Deng, Cheng Lu 0007, Junhao Wu, Jinyu Dai, Qiao Wang |
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 86(1), pp. 241-273, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Cheng-Ying Hsieh, Yi Ren 0001, Jyh-Cheng Chen |
Edge-Cloud Offloading: Knapsack Potential Game in 5G Multi-Access Edge Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 22(11), pp. 7158-7171, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xiaotong Li, Wei Fang 0001, Shuwei Zhu |
An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 648, pp. 119529, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ali Aouad, Danny Segev |
Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 71(4), pp. 1414-1433, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kimleang Kea, Chansreynich Huot, Youngsun Han |
Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 109964-109973, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Arij Mkaouar, Skander Htiouech, Habib Chabchoub |
Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 45255-45269, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mohammed Lalou, Hamamache Kheddouci |
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 158, pp. 106281, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton |
Solution techniques for Bi-level Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 159, pp. 106343, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | I. Esra Büyüktahtakin |
Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 153, pp. 106149, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ciriaco D'Ambrosio, Federica Laureana, Andrea Raiconi, Gaetano Vitale |
The Knapsack Problem with forfeit sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 151, pp. 106093, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 2811 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|