Suchergebnisse - constraint-based (constructive OR construct) heuristic algorithms

  • Treffer 1 - 18 von 18
Treffer weiter einschränken
  1. 1

    Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics von Wu, Peng, Cheng, Junheng, Chu, Feng

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.01.2021
    Veröffentlicht in Annals of operations research (01.01.2021)
    “… Due to its strong NP-hard nature, two fast new ϵ -constraint-based constructive heuristic algorithms are developed to solve …”
    Volltext
    Journal Article
  2. 2

    Optimal constraint-based decision tree induction from itemset lattices von Nijssen, Siegfried, Fromont, Elisa

    ISSN: 1384-5810, 1573-756X
    Veröffentlicht: Boston Springer US 01.07.2010
    Veröffentlicht in Data mining and knowledge discovery (01.07.2010)
    “… : we use local patterns to construct a global model. We exploit the connection between constraints in pattern mining and constraints in decision tree induction to develop a framework for categorizing decision tree mining constraints …”
    Volltext
    Journal Article
  3. 3

    Fast capture of textured full-body avatar with RGB-D cameras von Lin, Shuai, Chen, Yin, Lai, Yu-Kun, Martin, Ralph R., Cheng, Zhi-Quan

    ISSN: 0178-2789, 1432-2315
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
    Veröffentlicht in The Visual computer (01.06.2016)
    “… The configuration of the multiple cameras is formulated as a constraint-based minimum set space-covering problem, which is approximately solved by a heuristic algorithm …”
    Volltext
    Journal Article
  4. 4

    3off2: A network reconstruction algorithm based on 2-point and 3-point information statistics von Affeldt, Séverine, Verny, Louis, Isambert, Hervé

    ISSN: 1471-2105, 1471-2105
    Veröffentlicht: London BioMed Central 20.01.2016
    Veröffentlicht in BMC bioinformatics (20.01.2016)
    “… By contrast, constraint-based methods, such as the PC and IC algorithms, are expected to run in polynomial time on sparse underlying graphs, provided …”
    Volltext
    Journal Article
  5. 5

    Reinforcement Learning-Based Dynamic Coverage Control of Multi-Rotor UAVs With Safety Priority von Ma, Zhuangzhuang, You, Junjie, Zhang, Yunlin, Cheng, Yuhua, Shao, Jinliang

    ISSN: 1545-5955, 1558-3783
    Veröffentlicht: IEEE 2025
    “… This paper considers the dynamic coverage control of multi-rotor Unmanned Aerial Vehicles (UAVs) with the limited sensory range, which aims to collect sensor …”
    Volltext
    Journal Article
  6. 6

    One-Shot Learning for MIPs with SOS1 Constraints von Robinson La Rocca, Charly, Cordeau, Jean-François, Frejinger, Emma

    ISSN: 2662-2556, 2662-2556
    Veröffentlicht: Cham Springer International Publishing 01.09.2024
    Veröffentlicht in Operations Research Forum (01.09.2024)
    “… Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to dynamic situations such as supply chain disruptions …”
    Volltext
    Journal Article
  7. 7

    Knowledge Identification within the Decomposition of Homogeneous Classes of Objects von Terletskyi, Dmytro O., Yershov, Sergey V.

    ISSN: 2766-3639
    Veröffentlicht: IEEE 19.10.2023
    “… Therefore in this paper, we study the subclass identification within constraint-based filtering decomposition of homogeneous classes of objects, within the object object-oriented dynamic networks …”
    Volltext
    Tagungsbericht
  8. 8

    GNSS-based End-of-Train Device Performance Evaluation and Improvement by Means of Particle Filter Algorithm von Duan, Guotao, Lu, Debiao, Dong, Haoqi, Cai, Baigen, Wang, Jian, Liu, Jiang

    Veröffentlicht: IEEE 05.09.2022
    “… The Train Integrity Monitoring System (TIMS) function is becoming more and more demanding for the next generation for train control (NGTC) in both China and …”
    Volltext
    Tagungsbericht
  9. 9

    Data-driven control for dynamic quantized nonlinear systems with state constraints based on barrier functions von Wang, Xueli, Zhao, Shangwei, Wang, Xin, Yang, Ming, Wu, Xiaoming

    ISSN: 0020-0255
    Veröffentlicht: Elsevier Inc 01.10.2023
    Veröffentlicht in Information sciences (01.10.2023)
    “… By employing three sets of neural networks (NNs), a data-based goal representation heuristic dynamic programming algorithm with the concurrent learning technique is offered to achieve the near-optimal control objective without model requirement …”
    Volltext
    Journal Article
  10. 10

    One-shot Learning for MIPs with SOS1 Constraints von Charly Robinson La Rocca, Cordeau, Jean-François, Frejinger, Emma

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 14.03.2024
    Veröffentlicht in arXiv.org (14.03.2024)
    “… Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to dynamic situations such as supply chain disruptions …”
    Volltext
    Paper
  11. 11

    A procedure for the size, shape and topology optimization of transmission line tower structures von Souza, Rafael Rodrigues de, Fadel Miguel, Leandro Fleck, Lopez, Rafael Holdorf, Miguel, Letícia Fleck Fadel, Torii, André Jacomel

    ISSN: 0141-0296, 1873-7323
    Veröffentlicht: Elsevier Ltd 15.03.2016
    Veröffentlicht in Engineering structures (15.03.2016)
    “… •Structural design constraints based on ASCE 10-97 recommendations.•The topology optimization method allows the consideration of staggered bracing …”
    Volltext
    Journal Article
  12. 12

    Exact and heuristic procedures for capacity expansion problems with congestion von Kim, Sukgon, Uzsoy, Reha

    ISSN: 0740-817X, 2472-5854, 1545-8830, 2472-5862
    Veröffentlicht: Norcross Taylor & Francis Group 01.12.2008
    Veröffentlicht in IIE transactions (01.12.2008)
    “… Previous to this work non-linear constraints based on expected queue length have been used to represent congestion, whereas concave clearing functions that capture the relationship between expected …”
    Volltext
    Journal Article
  13. 13

    A new method for floor planning using topological constraint reduction von Vijayan, G., Tsay, R.-S.

    ISSN: 0278-0070
    Veröffentlicht: New York, NY IEEE 01.12.1991
    “… An approach to the constraint-based floor planning of flexible, fixed, and preplaced blocks that is based on the removal of redundant constraints and the reshaping of flexible blocks is discussed …”
    Volltext
    Journal Article
  14. 14

    Artificial Bee Colony Algorithm based static transmission expansion planning von Rathore, C., Roy, R., Sharma, U., Patel, J.

    ISBN: 9781467361491, 1467361496
    Veröffentlicht: IEEE 01.04.2013
    “… Based on direct current (DC) power flow model, this paper presents application of a population search based algorithm named, Artificial Bee Colony (ABC …”
    Volltext
    Tagungsbericht
  15. 15

    面向局部多约束的属性约简方法研究 von 董杰, 王逊, 张文冬, 王平心, 杨习贝

    ISSN: 1673-9418
    Veröffentlicht: 江苏科技大学 计算机学院,江苏 镇江,212003%江苏科技大学 理学院,江苏 镇江,212003 01.05.2019
    Veröffentlicht in 计算机科学与探索 (01.05.2019)
    “… TP18; 传统求解约简的启发式算法采用单一的度量指标作为约束条件,但这一策略并不能保证约简满足多重度量指标下约束需求.除此之外,绝大多数的约简定义是建立在考虑所有决策 …”
    Volltext
    Journal Article
  16. 16

    Combinatorial and global optimization (Series on applied mathematics-vol. 14) von Pardalos, Panos M, Migdalas, Athanasios, Burkard, Rainer E

    ISBN: 9810248024, 9789810248024, 9789812778215, 9812778217, 9789814489652, 9814489654
    Veröffentlicht: New Jersey ; Singapore World Scientific Publishing Co. Pte. Ltd 2002
    “… Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem …”
    Volltext
    E-Book Buch
  17. 17

    Introduction to distribution logistics von Brandimarte, Paolo, Zotteri, Giulio

    ISBN: 0471750441, 9780471750444
    Veröffentlicht: Hoboken, New Jersey John Wiley 2007
    “… unique introduction to distribution logistics that focuses on both quantitative modeling and practical business issues Introduction to Distribution Logistics …”
    Volltext
    E-Book Buch
  18. 18

    Selection Method for Cloud Manufacturing Industrial Services Based on Generative AdversarialNetworks von ZHENG Xiubao, LI Jing, ZHU Ming, NING Yingying

    ISSN: 1002-137X
    Veröffentlicht: Editorial office of Computer Science 01.04.2025
    Veröffentlicht in Ji suan ji ke xue (01.04.2025)
    “… ,it isn’t easy to select the best industrial resource services.Most of the existing selection optimization methods are based on heuristic algorithms,but these algorithms cannot often adapt to the cloud manufacturing …”
    Volltext
    Journal Article