Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Joachim Piehler (1930–2013) 2016-05-31 Paper A note on the solution of group knapsack problems 1992-06-26 Paper https://portal.mardi4nfdi.de/entity/Q3211111...
    10 bytes (16 words) - 03:06, 25 September 2023
  • Two-group knapsack game 2010-03-09 Paper On-line service scheduling 2009-08-28 Paper A successive approximation algorithm for the multiple knapsack problem...
    10 bytes (17 words) - 01:30, 11 December 2023
  • Worst-case analysis for on-line service policies 2010-03-09 Paper Two-group knapsack game 2010-03-09 Paper Global optimization for a class of fractional...
    10 bytes (17 words) - 11:53, 11 December 2023
  • polyhedra and their connection with cutting planes 2004-03-11 Paper Cyclic group and knapsack facets 2004-03-11 Paper...
    10 bytes (16 words) - 13:54, 24 September 2023
  • mardi4nfdi.de/entity/Q4495421 2000-08-10 Paper A relation between the knapsack and group knapsack problems 1998-11-03 Paper On aggregating two linear diophantine...
    10 bytes (16 words) - 12:57, 7 October 2023
  • 2004-03-11 Paper T-space and cutting planes 2004-03-11 Paper Cyclic group and knapsack facets 2004-03-11 Paper A linear Ricardo model with varying parameters...
    10 bytes (19 words) - 02:56, 11 December 2023
  • 2009-12-07 Paper Privatized rural postman problems 2006-06-30 Paper Cyclic group and knapsack facets 2004-03-11 Paper Forward chaining is simple\((x)\) 2000-03-21...
    10 bytes (16 words) - 21:36, 22 September 2023
  • Date of Publication Type Binary group facets with complete support and non-binary coefficients 2014-05-15 Paper Cyclic group blocking polyhedra 2013-05-06...
    10 bytes (19 words) - 16:29, 6 December 2023
  • Reaching, Pruning, and Buckets 1979-01-01 Paper Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound 1979-01-01 Paper Branching...
    10 bytes (18 words) - 12:12, 13 December 2023
  • mardi4nfdi.de/entity/Q4186114 1979-01-01 Paper Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound 1979-01-01 Paper Overtaking...
    10 bytes (18 words) - 06:24, 7 October 2023
  • Paper The Group-Theoretic Approach in Mixed Integer Programming 2010-06-03 Paper Relations between facets of low- and high-dimensional group problems 2010-04-15...
    10 bytes (21 words) - 02:07, 11 December 2023
  • buffer 2022-01-14 Paper Approximating the product knapsack problem 2021-09-28 Paper On the Stackelberg knapsack game 2021-06-04 Paper Integer programming models...
    10 bytes (17 words) - 21:51, 10 December 2023
  • for capacity planning of TFT-LCD manufacturing 2010-03-11 Paper Two-group knapsack game 2010-03-09 Paper Solution sets of interval-valued fuzzy relational...
    10 bytes (18 words) - 14:38, 8 December 2023
  • approaches for the two- and three-dimensional knapsack packing problem 2008-12-04 Paper The quadratic knapsack problem -- a survey 2007-04-13 Paper A general...
    10 bytes (17 words) - 12:34, 8 December 2023
  • Paper Hilbert Bases and the Facets of Special Knapsack Polytopes 1997-02-13 Paper Solving Multiple Knapsack Problems by Cutting Planes 1997-02-03 Paper Packing...
    10 bytes (16 words) - 07:14, 9 December 2023
  • analysis of strong knapsack facets 2017-03-23 Paper Separation algorithm for tree partitioning inequalities 2016-10-18 Paper Binary group facets with complete...
    10 bytes (17 words) - 10:16, 11 December 2023
  • multiple-choice multidimensional knapsack problem 2012-11-15 Paper Hybrid approaches for the two-scenario max-min knapsack problem 2012-09-25 Paper Variable...
    10 bytes (16 words) - 17:49, 8 December 2023
  • Implementations 2012-06-08 Paper Tabu search approaches for solving the two-group classification problem 2011-06-08 Paper https://portal.mardi4nfdi.de/entity/Q3002929...
    10 bytes (16 words) - 06:42, 12 December 2023
  • heuristic approach 2009-12-07 Paper A note on linear models for two-group and three-group two-dimensional guillotine cutting problems 2009-02-24 Paper Parallel...
    10 bytes (19 words) - 01:39, 13 December 2023
  • Publication Date of Publication Type On facilitating group decision making processes with VIP analysis 2024-04-05 Paper On a relaxed maximally disjoint...
    10 bytes (20 words) - 14:48, 10 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)