Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • to find all solutions in a neighborhood of the optimum 1985-01-01 Paper Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving...
    10 bytes (18 words) - 14:46, 23 September 2023
  • Publication Date of Publication Type Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization 2022-11-04 Paper...
    10 bytes (16 words) - 23:03, 27 December 2023
  • Publication Date of Publication Type Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization 2022-11-04 Paper...
    10 bytes (16 words) - 23:03, 27 December 2023
  • Publication Date of Publication Type Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization 2022-11-04 Paper...
    10 bytes (16 words) - 23:03, 27 December 2023
  • Publication Date of Publication Type Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization 2022-11-04 Paper...
    10 bytes (20 words) - 23:03, 27 December 2023
  • Publication Date of Publication Type Fast Convergence to Near Optimal Solution for Job Shop Scheduling Using Cat Swarm Optimization 2022-11-04 Paper...
    10 bytes (16 words) - 23:03, 27 December 2023
  • https://portal.mardi4nfdi.de/entity/Q4252009 2000-02-03 Paper Computing nearoptimal solutions to the steiner problem in a graph using a genetic algorithm 1997-02-03...
    10 bytes (16 words) - 01:45, 28 December 2023
  • Publication Date of Publication Type Provably near-optimal solutions for very large single-row facility layout problems 2009-09-18 Paper...
    10 bytes (16 words) - 02:41, 7 October 2023
  • Publication Date of Publication Type Near-optimal solutions of convex semi-infinite programs via targeted sampling 2022-11-15 Paper...
    10 bytes (16 words) - 23:55, 24 September 2023
  • Publication Date of Publication Type Near-optimal solutions of convex semi-infinite programs via targeted sampling 2022-11-15 Paper...
    10 bytes (16 words) - 23:55, 24 September 2023
  • Publication Date of Publication Type Near-optimal solutions for the generalized max-controlled set problem 2010-06-11 Paper The Generalized Max-Controlled...
    10 bytes (18 words) - 00:50, 25 September 2023
  • Publication Type A new model and solution method for product line design with pricing 2005-01-07 Paper Near Optimal Solutions for Product Line Design and Selection:...
    10 bytes (18 words) - 16:46, 6 October 2023
  • Publication Date of Publication Type Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect 2020-05-13...
    10 bytes (16 words) - 15:59, 6 October 2023
  • to the construction of four-couple folk dances 2014-09-01 Paper Near-optimal solutions to one-dimensional cutting stock problems 1986-01-01 Paper Postoptimality...
    10 bytes (18 words) - 17:42, 23 September 2023
  • algorithms for used spaces of storage supports 2020-07-22 Paper Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem...
    10 bytes (16 words) - 03:28, 25 September 2023
  • minimization personnel task scheduling problem 2018-09-18 Paper Near-optimal solution to an employee assignment problem with seniority 2011-04-08 Paper...
    10 bytes (16 words) - 03:45, 7 October 2023
  • for conversion to environmentally friendly fuel 2002-11-17 Paper Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics 1996-03-11...
    10 bytes (18 words) - 20:05, 6 October 2023
  • Publication Date of Publication Type Near-optimal MIP solutions for preference based self-scheduling 2016-05-18 Paper...
    10 bytes (18 words) - 05:36, 7 October 2023
  • Paper Online bin packing with advice 2016-03-23 Paper All-Around Near-Optimal Solutions for the Online Bin Packing Problem 2016-01-11 Paper Online Bin Packing...
    10 bytes (16 words) - 07:19, 7 October 2023
  • alignment 1984-01-01 Paper Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming...
    10 bytes (19 words) - 21:15, 9 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)