Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #51 to #100.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Retraction note to: ``Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain: Label: en
  2. Retraction note: ``Research on shale gas productivity prediction method based on optimization algorithm: Label: en
  3. Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines: Label: en
  4. Selecting intervals to optimize the design of observational studies subject to fine balance constraints: Label: en
  5. Online car-sharing problem with variable booking times: Label: en
  6. Retraction note to: ``AHI: a hybrid machine learning model for complex industrial information systems: Label: en
  7. Retraction note to: ``Premium rate making of jujube revenue insurance in Xinjiang Aksu region based on the mixed copula-stochastic optimization model: Label: en
  8. Retraction note: ``Industrial structure optimization, economic development factors and regional economic risk prevention in post COVID-19 period: empirical analysis based on panel data of Guangdong regional economy: Label: en
  9. Retraction note: ``Research on the influencing factors of living energy consumption and carbon emissions based on spatiotemporal model: Label: en
  10. Retraction note: ``Dynamic analysis of structures installed hysteretic dampers with hardening post-yielding stiffness using connection element method: Label: en
  11. Retraction note: ``Spatial-temporal deep learning model based rumor source identification in social networks: Label: en
  12. Retraction note: ``The mechanism and test of the impact of environmental regulation and technological innovation on high quality development: Label: en
  13. Retraction note: ``Optimal design of garments for high-temperature operations based on the finite difference method: Label: en
  14. Retraction note: ``Sector-like optimization model of 5G base transceiver stations redeployment and the generalization: Label: en
  15. Retraction note: ``Design of extended dense coding protocol strategy based on combinatorial optimization: Label: en
  16. Star covers and star partitions of double-split graphs: Label: en
  17. EPTAS for parallel identical machine scheduling with time restrictions: Label: en
  18. On the packing number of antibalanced signed simple planar graphs of negative girth at least 5: Label: en
  19. On convexity in split graphs: complexity of Steiner tree and domination: Label: en
  20. An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem: Label: en
  21. Improved shuffled frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems: Label: en
  22. The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO: Label: en
  23. A branch-and-cut algorithm for the balanced traveling salesman problem: Label: en
  24. Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges: Label: en
  25. Integrating supplier selection decisions into an inventory location problem for designing the supply chain network: Label: en
  26. Retraction note: ``Algorithm research on the influence of financing structure and cash holding on enterprise innovation based on system GMM model function theory: Label: en
  27. On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs: Label: en
  28. Approximation algorithms for the fault-tolerant facility location problem with submodular penalties: Label: en
  29. A linear ordering problem with weighted rank: Label: en
  30. A game theoretic approach for pricing and advertising of an integrated product family in a duopoly: Label: en
  31. Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation: Label: en
  32. Pilot pattern design scheme with branch and bound in PSA-OFDM system: Label: en
  33. Online bottleneck matching on a line: Label: en
  34. Tree-optimized labeled directed graphs: Label: en
  35. On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques: Label: en
  36. Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time: Label: en
  37. Research on sensitive text classification detection and classification based on improved artificial neural network: Label: en
  38. Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures: Label: en
  39. Area, perimeter, height, and width of rectangle visibility graphs: Label: en
  40. Minmax for facility location game with optional preference under minimum distance requirement: Label: en
  41. Discrete facility location games with different preferences: Label: en
  42. Signed rearrangement distances considering repeated genes, intergenic regions, and indels: Label: en
  43. Online \(k\)-color spanning disk problems: Label: en
  44. On a generalization of the spectral Mantel's theorem: Label: en
  45. An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller: Label: en
  46. Optimal design of garments for high-temperature operations based on the finite difference method: Label: en
  47. Complete forcing numbers of complete and almost-complete multipartite graphs: Label: en
  48. Tight bounds for the price of anarchy and stability in sequential transportation games: Label: en
  49. Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost: Label: en
  50. Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)