共 50 条
- [41] A Vehicle Scheduling Algorithm Based on Vertex Covering by a Set of Disjoint Paths 28TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2010, PTS I AND II, 2010, : 489 - 494
- [42] A GRASP-based scheme for the set covering problem OPERATIONAL RESEARCH, 2021, 21 (04) : 2391 - 2408
- [44] A CLONALG-based approach for the set covering problem 2012 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2012, : 42 - 49
- [46] An overview of optical flow-based approaches for motion segmentation IMAGING SCIENCE JOURNAL, 2019, 67 (05): : 284 - 294
- [47] A Flow-Based Heuristic Algorithm for Network Operations Planning in Smart Grids IECON 2018 - 44TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2018, : 3529 - 3534
- [48] Enhanced Flow-based Model of Multipath Routing with Overlapping by Nodes Paths 2015 SECOND INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE PROBLEMS OF INFOCOMMUNICATIONS SCIENCE AND TECHNOLOGY (PIC S&T 2015), 2015, : 42 - 45
- [49] Constraint-based approaches to the covering test problem RECENT ADVANCES IN CONSTRAINTS, 2005, 3419 : 172 - 186
- [50] A comparative study of a penalty function, a repair heuristic, and stochastic operators with the set-covering problem ARTIFICIAL EVOLUTION, 1996, 1063 : 320 - 332