Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Minimum relevant variables in linear system
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Minimum_relevant_variables_in_linear_system
http://dbpedia.org/ontology/abstract MINimum Relevant Variables in Linear SysteMINimum Relevant Variables in Linear System (Min-RVLS) is a problem in mathematical optimization. Given a linear program, it is required to find a feasible solution in which the number of non-zero variables is as small as possible. The problem is known to be NP-hard and even hard to approximate.o be NP-hard and even hard to approximate.
http://dbpedia.org/ontology/wikiPageID 59597756
http://dbpedia.org/ontology/wikiPageLength 7483
http://dbpedia.org/ontology/wikiPageRevisionID 1052222724
http://dbpedia.org/ontology/wikiPageWikiLink http://dbpedia.org/resource/Category:NP-hard_problems + , http://dbpedia.org/resource/Machine_learning + , http://dbpedia.org/resource/Category:Approximation_algorithms + , http://dbpedia.org/resource/Minimum_dominating_set + , http://dbpedia.org/resource/Category:Linear_programming + , http://dbpedia.org/resource/Mathematical_optimization + , http://dbpedia.org/resource/Linear_discriminant_analysis + , http://dbpedia.org/resource/Category:Combinatorial_optimization + , http://dbpedia.org/resource/Coding_theory + , http://dbpedia.org/resource/DTIME + , http://dbpedia.org/resource/Minimum_feedback_arc_set + , http://dbpedia.org/resource/Linear_program + , http://dbpedia.org/resource/Minimum_feature_set_problem + , http://dbpedia.org/resource/Shortest_codeword_problem + , http://dbpedia.org/resource/NP-hardness +
http://dbpedia.org/property/wikiPageUsesTemplate http://dbpedia.org/resource/Template:Reflist + , http://dbpedia.org/resource/Template:Rp +
http://purl.org/dc/terms/subject http://dbpedia.org/resource/Category:Combinatorial_optimization + , http://dbpedia.org/resource/Category:Linear_programming + , http://dbpedia.org/resource/Category:Approximation_algorithms + , http://dbpedia.org/resource/Category:NP-hard_problems +
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Minimum_relevant_variables_in_linear_system?oldid=1052222724&ns=0 +
http://xmlns.com/foaf/0.1/isPrimaryTopicOf http://en.wikipedia.org/wiki/Minimum_relevant_variables_in_linear_system +
owl:sameAs http://dbpedia.org/resource/Minimum_relevant_variables_in_linear_system + , http://www.wikidata.org/entity/Q60769030 + , https://global.dbpedia.org/id/9MeGR +
rdfs:comment MINimum Relevant Variables in Linear SysteMINimum Relevant Variables in Linear System (Min-RVLS) is a problem in mathematical optimization. Given a linear program, it is required to find a feasible solution in which the number of non-zero variables is as small as possible. The problem is known to be NP-hard and even hard to approximate.o be NP-hard and even hard to approximate.
rdfs:label Minimum relevant variables in linear system
hide properties that link here 
http://dbpedia.org/resource/Maximum_feasible_linear_subsystem + , http://dbpedia.org/resource/Minimum_unsatisfied_linear_relations + http://dbpedia.org/ontology/wikiPageRedirects
http://dbpedia.org/resource/Combinatorial_optimization + , http://dbpedia.org/resource/Maximum_feasible_linear_subsystem + , http://dbpedia.org/resource/Minimum_unsatisfied_linear_relations + , http://dbpedia.org/resource/Minimum_weight_solution_to_linear_equations + http://dbpedia.org/ontology/wikiPageWikiLink
http://en.wikipedia.org/wiki/Minimum_relevant_variables_in_linear_system + http://xmlns.com/foaf/0.1/primaryTopic
http://dbpedia.org/resource/Minimum_relevant_variables_in_linear_system + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.