Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • problem 2009-09-25 Paper Computational experience with general cutting planes for the set covering problem 2009-02-23 Paper A computational study of local search...
    10 bytes (17 words) - 15:06, 8 December 2023
  • Publication Date of Publication Type Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition...
    10 bytes (16 words) - 14:30, 24 September 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q4347850 1997-08-11 Paper Computational experience with penalty-barrier methods for nonlinear programming 1996-07-01...
    10 bytes (19 words) - 00:11, 12 December 2023
  • Note—Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience 1977-01-01 Paper Nested Decomposition of Multistage Convex Programs...
    10 bytes (18 words) - 10:05, 7 October 2023
  • Publication Date of Publication Type Computational Experience with an M-Salesman Traveling Salesman Algorithm 1973-01-01 Paper...
    10 bytes (18 words) - 21:35, 27 December 2023
  • Publication Date of Publication Type Computational experience with the solution of the matrix Lyapunov equation 1976-01-01 Paper...
    10 bytes (18 words) - 02:01, 28 December 2023
  • Publication Date of Publication Type Computational experience with Davidon's least-square algorithm 1980-01-01 Paper...
    10 bytes (18 words) - 12:51, 7 October 2023
  • Publication Date of Publication Type Computational experience with Davidon's least-square algorithm 1980-01-01 Paper...
    10 bytes (18 words) - 12:51, 7 October 2023
  • telephonic switching centre network problem: Formalization and computational experience 1987-01-01 Paper...
    10 bytes (20 words) - 18:32, 23 September 2023
  • Publication Date of Publication Type Computational experience with an algorithm for tetrangle inequality bound smoothing 1989-01-01 Paper...
    10 bytes (18 words) - 09:49, 24 September 2023
  • Publication Date of Publication Type Computational experience with general equilibrium problems 1996-12-15 Paper...
    10 bytes (16 words) - 20:27, 24 September 2023
  • Publication Date of Publication Type Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization 2021-09-14...
    10 bytes (18 words) - 22:03, 24 September 2023
  • Publication Type A Note on the Fermat Problem 1976-01-01 Paper Computational Experience in Solving Linear Programs 1953-01-01 Paper...
    10 bytes (16 words) - 12:21, 14 March 2024
  • 2019-06-18 Paper Truck and trailer routing -- problems, heuristics and computational experience 2016-11-14 Paper Multilevel neighborhood search for solving full...
    10 bytes (16 words) - 10:35, 7 October 2023
  • reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances 2018-05-23 Paper A branch and cut heuristic...
    10 bytes (17 words) - 02:54, 11 December 2023
  • 2002-05-27 Paper Gigaflops in linear programming 1997-02-03 Paper Computational experience with a globally convergent primal-dual predictor-corrector algorithm...
    10 bytes (19 words) - 23:38, 12 December 2023
  • of Publication Type OpenMP for networks of SMPs 2001-10-01 Paper Computational experience with parallel mixed integer programming in a distributed environment...
    10 bytes (18 words) - 23:44, 8 December 2023
  • bounds in integer quadratic optimization problems 1993-01-16 Paper Computational experience with an interior point algorithm on the satisfiability problem...
    10 bytes (18 words) - 16:51, 12 December 2023
  • Nonlinear and geometric programming -- current status 2002-03-26 Paper Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming...
    10 bytes (18 words) - 00:22, 9 December 2023
  • interior point algorithm to solve computationally difficult set covering problems 1992-06-27 Paper Computational experience with an interior point algorithm...
    10 bytes (19 words) - 16:51, 12 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)