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 #1 to #50.

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

  1. A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem: Label: en
  2. On supply and network investment in power systems: Label: en
  3. On finding the community with maximum persistence probability: Label: en
  4. An optimal algorithm for variable knockout problems: Label: en
  5. Is the best-worst method path dependent? Evidence from an empirical study: Label: en
  6. Minimization of maximum lateness on parallel machines with a single server and job release dates: Label: en
  7. Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies. II: Label: en
  8. Consensus reaching process for portfolio selection: a behavioral approach: Label: en
  9. Patient referral strategy and cost sharing for a medical consortium: Label: en
  10. A new self-scaling memoryless quasi-Newton update for unconstrained optimization: Label: en
  11. Customer joining strategies in Markovian queues with b-limited service rule and multiple vacations: Label: en
  12. Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies. I: Label: en
  13. A tutorial on value function approximation for stochastic and dynamic transportation: Label: en
  14. Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization: Label: en
  15. Inductive linearization for binary quadratic programs with linear constraints: a computational study: Label: en
  16. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times: Label: en
  17. A generalization of the CIS value for cooperative cost games: Label: en
  18. 21 volumes for the 21st century: Label: en
  19. A two-objective optimization of ship itineraries for a cruise company: Label: en
  20. Time-locked free trial strategy in duopoly markets with switching costs: Label: en
  21. An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem: Label: en
  22. A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle: Label: en
  23. A survey of attended home delivery and service problems with a focus on applications: Label: en
  24. Correction to: ``Inductive linearization for binary quadratic programs with linear constraints: Label: en
  25. A hybrid heuristic for the rectilinear picture compression problem: Label: en
  26. Retailer's optimal CSR investment in closed-loop supply chains: the impacts of supply chain structure and channel power structure: Label: en
  27. An improved decision support model for scheduling production in an engineer-to-order manufacturer: Label: en
  28. Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint: Label: en
  29. A study of connectivity on dynamic graphs: computing persistent connected components: Label: en
  30. Multiple criteria sorting models and methods. II: Theoretical results and general issues: Label: en
  31. Union-wise egalitarian solutions in cooperative games with a coalition structure: Label: en
  32. Approximating the chance-constrained capacitated vehicle routing problem with robust optimization: Label: en
  33. Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer: Label: en
  34. A bilevel optimization model for the newsvendor problem with the focus theory of choice: Label: en
  35. A note on batch scheduling on a two-machine flowshop with machine-dependent processing times: Label: en
  36. Critical node/edge detection problems on trees: Label: en
  37. A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work: Label: en
  38. Integer knapsack problems with profit functions of the same value range: Label: en
  39. An introduction to variational quantum algorithms for combinatorial optimization problems: Label: en
  40. Comparing stage-scenario with nodal formulation for multistage stochastic problems: Label: en
  41. A binary search algorithm for the general coupled task scheduling problem: Label: en
  42. Mixed integer programming formulations for the generalized traveling salesman problem with time windows: Label: en
  43. Inductive linearization for binary quadratic programs with linear constraints: Label: en
  44. Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective: Label: en
  45. Pricing and strategy selection in a closed-loop supply chain under demand and return rate uncertainty: Label: en
  46. A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization: Label: en
  47. Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems: Label: en
  48. A decomposition based minimax regret approach for inverse multiple criteria sorting problem: Label: en
  49. A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference: Label: en
  50. A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem: Label: en

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