Výsledky vyhľadávania - "Enumeration algorithm"

  1. 1

    Enumerating floorplans with walls Autor Yamanaka, Katsuhisa, Nakano, Shin-ichi

    ISSN: 0166-218X, 1872-6771
    Vydavateľské údaje: Elsevier B.V 15.01.2024
    Vydané v Discrete Applied Mathematics (15.01.2024)
    “…Let P be a set of n points in the proper inside of an axis-aligned rectangle R, and each point in P has a type, which is h-type, v-type, or f-type. Those are…”
    Získať plný text
    Journal Article
  2. 2

    Extension of backward induction for the enumeration of pure Nash equilibria outcomes Autor Zappalà, Paolo, Benhamiche, Amal, Chardy, Matthieu, De Pellegrini, Francesco, Figueiredo, Rosa

    ISSN: 0167-6377
    Vydavateľské údaje: Elsevier B.V 01.07.2025
    Vydané v Operations research letters (01.07.2025)
    “…Extensive-form games with perfect information admit at least one Nash equilibrium. The backward induction algorithm identifies in linear time a Nash…”
    Získať plný text
    Journal Article
  3. 3

    A bi-level programming model for inter-city charging station location with heterogeneous range anxiety Autor Hu, Dingding, Zhou, Kaile, Lu, Xinhui

    ISSN: 0360-5442
    Vydavateľské údaje: Elsevier Ltd 01.02.2025
    Vydané v Energy (Oxford) (01.02.2025)
    “…With the rapid expansion of electric vehicles, the distribution of charging stations is inadequate to meet travel demands, especially for long-distance trips…”
    Získať plný text
    Journal Article
  4. 4

    Exact and heuristic algorithms for the domination problem Autor Parra Inza, Ernesto, Vakhania, Nodari, Sigarreta Almira, José María, Hernández Mira, Frank Angel

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 16.03.2024
    “…•A good exact enumeration algorithm for a hard problem is fast in practice.•An integer linear programming (ILP) formulation.•A good exact enumeration algorithm…”
    Získať plný text
    Journal Article
  5. 5

    Attacking (EC)DSA scheme with ephemeral keys sharing specific bits Autor Adamoudis, M., Draziotis, K.A., Poulakis, D.

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 27.06.2024
    Vydané v Theoretical computer science (27.06.2024)
    “…In this paper, we present a deterministic attack on (EC)DSA signature scheme, providing that several signatures are known such that the corresponding ephemeral…”
    Získať plný text
    Journal Article
  6. 6

    Dual bounded generation: Polynomial, second-order cone and positive semidefinite matrix inequalities Autor Elbassioni, Khaled

    ISSN: 0166-218X
    Vydavateľské údaje: Elsevier B.V 31.03.2025
    Vydané v Discrete Applied Mathematics (31.03.2025)
    “…In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector…”
    Získať plný text
    Journal Article
  7. 7

    Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming Autor Chen, Wenchong, Gong, Xuejian, Rahman, Humyun Fuad, Liu, Hongwei, Qi, Ershi

    ISSN: 0305-0483, 1873-5274
    Vydavateľské údaje: Elsevier Ltd 01.12.2021
    Vydané v Omega (Oxford) (01.12.2021)
    “…•A data-driven representation is proposed to predict dynamic production status of flow shops and to estimate jobs’ makespan.•A bilevel interactive optimization…”
    Získať plný text
    Journal Article
  8. 8

    Globally optimal synthesis of heat exchanger networks. Part I: Minimal networks Autor Chang, Chenglin, Peccini, Alice, Wang, Yufei, Costa, André L. H., Bagajewicz, Miguel J.

    ISSN: 0001-1541, 1547-5905
    Vydavateľské údaje: Hoboken, USA John Wiley & Sons, Inc 01.07.2020
    Vydané v AIChE journal (01.07.2020)
    “…This article introduces the concept of minimal structure (MSTR) and presents an enumeration algorithm for the synthesis of heat exchanger networks based on…”
    Získať plný text
    Journal Article
  9. 9
  10. 10

    Finding k-secluded trees faster Autor Donkers, Huib, Jansen, Bart M.P., de Kroon, Jari J.H.

    ISSN: 0022-0000, 1090-2724
    Vydavateľské údaje: Elsevier Inc 01.12.2023
    “…We revisit the k-Secluded Tree problem. Given a vertex-weighted undirected graph G, its objective is to find a maximum-weight induced subtree T whose open…”
    Získať plný text
    Journal Article
  11. 11

    Efficiently enumerating hitting sets of hypergraphs arising in data profiling Autor Bläsius, Thomas, Friedrich, Tobias, Lischeid, Julius, Meeks, Kitty, Schirneck, Martin

    ISSN: 0022-0000, 1090-2724
    Vydavateľské údaje: Elsevier Inc 01.03.2022
    “…The transversal hypergraph problem asks to enumerate the minimal hitting sets of a hypergraph. If the solutions have bounded size, Eiter and Gottlob…”
    Získať plný text
    Journal Article
  12. 12

    ChEMBL-Likeness Score and Database GDBChEMBL Autor Bühlmann, Sven, Reymond, Jean-Louis

    ISSN: 2296-2646, 2296-2646
    Vydavateľské údaje: Switzerland Frontiers Media S.A 04.02.2020
    Vydané v Frontiers in chemistry (04.02.2020)
    “…The generated database GDB17 enumerates 166.4 billion molecules up to 17 atoms of C, N, O, S and halogens following simple rules of chemical stability and…”
    Získať plný text
    Journal Article
  13. 13

    Constant amortized time enumeration of Eulerian trails Autor Kurita, Kazuhiro, Wasa, Kunihiro

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 26.06.2022
    Vydané v Theoretical computer science (26.06.2022)
    “…•Eulerian trails are classical and important objects in theoretical computer science field.•Enumeration of Eulerian trails is known to be #P-complete.•Although…”
    Získať plný text
    Journal Article
  14. 14

    An Efficient Cross-Platform Workflow Optimization Method Autor DU Qinghua, ZHANG Kai

    ISSN: 1000-3428
    Vydavateľské údaje: Editorial Office of Computer Engineering 01.07.2022
    Vydané v Ji suan ji gong cheng (01.07.2022)
    “…To manage complex data analysis tasks, cross-platform data processing systems combining multiple platforms are being developed.The platform selection of…”
    Získať plný text
    Journal Article
  15. 15

    Algorithms for Enumeration of Lattice Paths with Constraints and Rooted Trees by Various Parameters Autor Balagura, A. A., Kuzmin, O. V.

    ISSN: 1072-3374, 1573-8795
    Vydavateľské údaje: Cham Springer International Publishing 01.06.2025
    “…Approaches to enumerating various types of objects are demonstrated: with restrictions, labeled, and unlabeled. An algorithmic scheme for constructing…”
    Získať plný text
    Journal Article
  16. 16

    An optimal design model for tunnel lighting systems Autor Li, Shu Guang, Tu, Gang, Zhou, Qinghua

    ISSN: 0030-4026, 1618-1336
    Vydavateľské údaje: Elsevier GmbH 01.01.2021
    Vydané v Optik (Stuttgart) (01.01.2021)
    “…We propose an optimal design model for determining light sources, powers, layout modes, and equipment spacing of lamps in tunnels that not only effectively…”
    Získať plný text
    Journal Article
  17. 17

    Tri-level decision-making for decentralized vendor-managed inventory Autor Han, Jialin, Lu, Jie, Zhang, Guangquan

    ISSN: 0020-0255, 1872-6291
    Vydavateľské údaje: Elsevier Inc 01.12.2017
    Vydané v Information sciences (01.12.2017)
    “…Vendor-managed inventory (VMI) is a common inventory management policy which allows the vendor to manage the buyer's inventory based on the information shared…”
    Získať plný text
    Journal Article
  18. 18

    A ridesharing routing problem for airport riders with electric vehicles Autor Zhang, Li, Liu, Zhongshan, Yu, Bin, Long, Jiancheng

    ISSN: 1366-5545, 1878-5794
    Vydavateľské údaje: Elsevier Ltd 01.04.2024
    “…This paper proposes a ridesharing routing problem for airport riders motivated by a practical application. This problem designs routes for electric vehicles…”
    Získať plný text
    Journal Article
  19. 19

    On the exact solution of the no-wait flow shop problem with due date constraints Autor Samarghandi, Hamed, Behroozi, Mehdi

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.05.2017
    Vydané v Computers & operations research (01.05.2017)
    “…•Five different mathematical programming models and two constraint programming models are developed for the no-wait flow shop problem with due date…”
    Získať plný text
    Journal Article
  20. 20

    Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount Autor Malekian, Yaser, Mirmohammadi, S. Hamid, Bijari, Mehdi

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.10.2021
    Vydané v Computers & operations research (01.10.2021)
    “…•We investigated a single item capacitated lot sizing problem with quantity discount.•We defined the concept of irregular orders in the optimal solution of the…”
    Získať plný text
    Journal Article