All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

67 486 (0,321s) •

Result

Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program

We show that the general linear programming (LP) problem reduces in nearly linear time to the LP relaxations of many classical NP-hard combinatorial problems, maximum independent set, and multiway cut), the input <...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019
    • •
  • Jimp
    • •
  • Link
Result

Interval linear programming techniques in constraint programming and global optimization

linearize the constraints to get an interval linear system of equations and inequalities. Then, we adapt techniques from interval linear programming to find a polyhedral relaxation to the solution set. Th...

BA - Obecná matematika

  • 2014
    • •
  • D
    • •
  • Link
Result

The Power of LP Relaxation for MAP Inference

approachesto this problem is linear programming (LP) relaxation. We discuss this LP relaxation from two aspects. First, we review recent results which characterize languages issolved by the relaxation exa...

JD - Využití počítačů, robotika a její aplikace

  • 2014
    • •
  • C
    • •
  • Link
Result

LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP

We show that solving linear programming (LP) relaxations of many classical NP problem. Precisely, the general LP can be reduced in linear time to the LP relaxation linear-time reductions, we show ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • D
    • •
  • Link
Result

LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program

or discrete energy minimization) is not much easier than solving any linear program. Precisely, the general linear program reduces in linear time (assuming the Turing model of computation) to the LP r...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • Jimp
    • •
  • Link
Result

Using Constraint Propagation to Bound Linear Programs

, the method is not guaranteed to converge to a global solution of the linear program and the used propagation method. The approach is suited for large sparse linear programsWe present an approach to compute bounds...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
    • •
  • Jimp
    • •
  • Link
Result

OPTIMIZATION-BASED APPROACH TO TILING OF FINITE AREAS WITH ARBITRARY SETS OF WANG TILES

the NP-complete tiling generation problem as a binary linear program, together with its linear and semidefinite relaxations suitable for the branch and bound method of several aperiodic tilings reported in the lit...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • D
    • •
  • Link
Result

Augmenting DAG algorithm to LP relaxation of WCSP

Implementation of the Augmenting DAG algorithm (originally proposed by Koval and Schlesinger in 1976) to compute linear programming relaxation of the Weighted Constraint Satisfaction Problem (WCSP) (also known as maximizing...

JD - Využití počítačů, robotika a její aplikace

  • 2008
    • •
  • R
Result

A Class of Linear Programs Solvable by Coordinate-Wise Minimization

problems it may not find global minima. We present a class of linear programs that coordinate-wise minimization solves exactly. We show that dual LP relaxations of several reasonably good suboptima. Though the presented LP...

Mathematics

  • 2020
    • •
  • D
    • •
  • Link
Result

Iterative methods for solving systems of linear equations

The program is made for evaluation systems of linear equations using iterative relaxation methods. During entering data in the coefficient matrix of the system, symmetricity and positive definity. The application contains t...

JD - Využití počítačů, robotika a její aplikace

  • 2010
    • •
  • R
  • 1 - 10 out of 67 486