Search results

From MaRDI portal

  • Matthias Köppe
    2011-03-07 Paper Parametric integer programming algorithm for bilevel mixed integer programs 2010-10-27 Paper FPTAS for mixed-integer polynomial optimization...
    10 bytes (15 words) - 23:16, 9 December 2023
  • H. W. jun. Lenstra
    zbMath Open lenstra.hendrik-w-junDBLP00/418WikidataQ173783 ScholiaQ173783MaRDI QIDQ165880 This page was built for person: H. W. jun. Lenstra...
    10 bytes (19 words) - 16:17, 7 December 2023
  • Jan Karel Lenstra
    zbMath Open lenstra.jan-karelDBLPl/JKLenstraWikidataQ6149223 ScholiaQ6149223MaRDI QIDQ1329788 This page was built for person: Jan Karel Lenstra...
    10 bytes (17 words) - 17:50, 12 December 2023
  • Herman te Riele
    Methods for the Linear Generalized Abel Integral Equation 1986-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3029062 1986-01-01 Paper A program for solving...
    10 bytes (17 words) - 02:23, 10 December 2023
  • Henri Lombardi
    2006-10-19 Paper The Berlekamp-Massey algorithm revisited 2006-09-12 Paper Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations 2006-05-31...
    10 bytes (13 words) - 08:51, 9 December 2023
  • scientific article; zbMATH DE number 3908520
    timecomputational number theoryGrötschel-Lovász-Schrijver versionLenstra's integer linear programming algorithmLovász-reduced basisnonhomogeneous simultaneous diophantine...
    15 bytes (215 words) - 08:04, 5 February 2024
  • Combinatorial \(n\)-fold integer programming and applications
    Combinatorial \(n\)-fold integer programming and applications Theory and Applications of n-Fold Integer Programming \(N\)-fold integer programming Publication:4040221...
    15 bytes (1,050 words) - 01:41, 2 February 2024
  • Complexity of integer quasiconvex polynomial optimization
    randomized sieving algorithm for approximate integer programming On approximation algorithms for concave mixed-integer quadratic programming On the complexity...
    15 bytes (493 words) - 18:52, 2 February 2024
  • Lattice-free simplices with lattice width \(2d - o(d)\)
    lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has been done to obtain...
    15 bytes (549 words) - 00:32, 2 February 2024
  • Factoring polynomials with rational coefficients
    value data mine Valid inequalities for mixed integer linear programs The inverse moment problem for convex polytopes Some lattice attacks on DSA and ECDSA Numerical...
    15 bytes (1,100 words) - 04:55, 31 January 2024
  • Integer Programming with a Fixed Number of Variables
    bound algorithm for integer programming based on ``flatness information Parametric integer programming algorithm for bilevel mixed integer programs The inapproximability...
    15 bytes (1,026 words) - 21:39, 3 February 2024
  • A hierarchy of polynomial time lattice basis reduction algorithms
    (11H55) Cites Work Factoring polynomials with rational coefficients Integer Programming with a Fixed Number of Variables Disproof of the Mertens conjecture...
    15 bytes (1,119 words) - 01:33, 31 January 2024
  • On Lovász' lattice reduction and the nearest lattice point problem
    theory for integer-type algorithm for higher order differential equations Practical implementation and error bound of integer-type algorithm for higher-order...
    15 bytes (1,207 words) - 00:29, 31 January 2024
  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
    survey of scheduling problems with setup times or costs A mixed integer linear programming approach to minimize the number of late jobs with and without...
    15 bytes (1,364 words) - 13:18, 6 February 2024
  • Non-standard approaches to integer programming
    that?) A Simplified Primal (All-Integer) Integer Programming Algorithm A primal (all-integer) integer programming algorithm Computational experience with...
    15 bytes (1,021 words) - 09:51, 30 January 2024
  • Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
    shortest vectors The Generalized Basis Reduction Algorithm Non-standard approaches to integer programming Nonembeddability theorems via Fourier analysis...
    15 bytes (855 words) - 10:26, 30 January 2024
  • Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
    Approximation algorithms for covering/packing integer programs Combinatorial \(n\)-fold integer programming and applications Integer optimization on convex semialgebraic...
    15 bytes (810 words) - 13:42, 2 February 2024
  • Integer programming in parameterized complexity: five miniatures
    the complexity of integer programming Nonlinear discrete optimization. An algorithmic theory Nonlinear integer programming On integer points in polyhedra...
    15 bytes (757 words) - 10:49, 3 February 2024
  • Solving low-density subset sum problems
    assumptions Non-standard approaches to integer programming The optimal LLL algorithm is still polynomial in fixed dimension. Lattice points in high-dimensional...
    15 bytes (682 words) - 12:16, 5 February 2024
  • Column basis reduction and decomposable knapsack problems
    0-1 programs Integer Programming with a Fixed Number of Variables Minkowski's Convex Body Theorem and Integer Programming Disjunctive Programming Solving...
    15 bytes (757 words) - 13:57, 30 January 2024
Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:Search"
Powered by MediaWiki