Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Combinatorial optimization
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
3867956
(xsd:integer)
dbo:
wikiPageRevisionID
975676022
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Commons_category
dbt
:Cat_main
rdf:
type
skos
:Concept
rdfs:
label
Combinatorial optimization
(en)
skos:
broader
dbc
:Search_algorithms
dbc
:Combinatorial_algorithms
dbc
:Mathematical_optimization
dbc
:Network_theory
skos:
prefLabel
Combinatorial optimization
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Combinatorial_optimization?oldid=975676022&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:Metric_k-center
dbr
:Branch_and_bound
dbr
:Cutting_stock_problem
dbr
:Vehicle_routing_problem
dbr
:Integer_programming
dbr
:List_of_knapsack_problems
dbr
:1-center_problem
dbr
:Criss-cross_algorithm
dbr
:Matching_(graph_theory)
dbr
:Matroid_parity_problem
dbr
:Max-flow_min-cut_theorem
dbr
:Maximum_cut
dbr
:Ellipsoid_method
dbr
:Generalized_assignment_problem
dbr
:Network_flow_problem
dbr
:Subadditive_set_function
dbr
:Quadratic_pseudo-Boolean_optimization
dbr
:Egalitarian_item_allocation
dbr
:Gomory–Hu_tree
dbr
:Graph_bandwidth
dbr
:Bottleneck_traveling_salesman_problem
dbr
:Branch_and_cut
dbr
:Branch_and_price
dbr
:Configuration_linear_program
dbr
:Continuous_knapsack_problem
dbr
:Quadratic_bottleneck_assignment_problem
dbr
:Closure_problem
dbr
:Combinatorial_data_analysis
dbr
:Combinatorial_optimization
dbr
:Combinatorial_search
dbr
:Kernighan–Lin_algorithm
dbr
:Matroid_intersection
dbr
:Maximum_satisfiability_problem
dbr
:Maximum_weight_matching
dbr
:Utility_functions_on_indivisible_goods
dbr
:Cederbaum's_maximum_flow_theorem
dbr
:Travelling_salesman_problem
dbr
:Linear_bottleneck_assignment_problem
dbr
:Linear_programming_relaxation
dbr
:Lin–Kernighan_heuristic
dbr
:Minimum_k-cut
dbr
:Minimum_relevant_variables_in_linear_system
dbr
:A*_search_algorithm
dbr
:Cut_(graph_theory)
dbr
:Bridge_and_torch_problem
dbr
:Parametric_search
dbr
:Floorplan_(microelectronics)
dbr
:Graph_cut_optimization
dbr
:Quadratic_assignment_problem
dbr
:Quadratic_knapsack_problem
dbr
:Jack_Edmonds
dbr
:Hungarian_algorithm
dbr
:Snow_plow_routing_problem
dbr
:Edge_cycle_cover
dbr
:Weight_function
dbr
:Dijkstra's_algorithm
dbr
:Assignment_problem
dbr
:B*
dbr
:Greedoid
dbr
:Greedy_randomized_adaptive_search_procedure
dbr
:Change-making_problem
dbr
:Knapsack_problem
dbr
:Weapon_target_assignment_problem
dbr
:European_Chapter_on_Combinatorial_Optimization
dbr
:Extremal_combinatorics
dbr
:Gilbert–Pollack_conjecture
dbr
:Symmetry-breaking_constraints
dbr
:Vertex_k-center_problem
dbr
:Multidimensional_assignment_problem
dbr
:Smallest-circle_problem
dbr
:Submodular_set_function
dbr
:Steiner_travelling_salesman_problem
dbr
:Superadditive_set_function
is
dcterms:
subject
of
dbr
:Metric_k-center
dbr
:Branch_and_bound
dbr
:Cutting_stock_problem
dbr
:Vehicle_routing_problem
dbr
:Integer_programming
dbr
:List_of_knapsack_problems
dbr
:1-center_problem
dbr
:Criss-cross_algorithm
dbr
:Matching_(graph_theory)
dbr
:Matroid_parity_problem
dbr
:Max-flow_min-cut_theorem
dbr
:Maximum_cut
dbr
:Ellipsoid_method
dbr
:Generalized_assignment_problem
dbr
:Network_flow_problem
dbr
:Subadditive_set_function
dbr
:Quadratic_pseudo-Boolean_optimization
dbr
:Egalitarian_item_allocation
dbr
:Gomory–Hu_tree
dbr
:Graph_bandwidth
dbr
:Bottleneck_traveling_salesman_problem
dbr
:Branch_and_cut
dbr
:Branch_and_price
dbr
:Configuration_linear_program
dbr
:Continuous_knapsack_problem
dbr
:Quadratic_bottleneck_assignment_problem
dbr
:Closure_problem
dbr
:Combinatorial_data_analysis
dbr
:Combinatorial_optimization
dbr
:Combinatorial_search
dbr
:Kernighan–Lin_algorithm
dbr
:Matroid_intersection
dbr
:Maximum_satisfiability_problem
dbr
:Maximum_weight_matching
dbr
:Utility_functions_on_indivisible_goods
dbr
:Cederbaum's_maximum_flow_theorem
dbr
:Travelling_salesman_problem
dbr
:Linear_bottleneck_assignment_problem
dbr
:Linear_programming_relaxation
dbr
:Lin–Kernighan_heuristic
dbr
:Minimum_k-cut
dbr
:Minimum_relevant_variables_in_linear_system
dbr
:A*_search_algorithm
dbr
:Cut_(graph_theory)
dbr
:Bridge_and_torch_problem
dbr
:Parametric_search
dbr
:Floorplan_(microelectronics)
dbr
:Graph_cut_optimization
dbr
:Quadratic_assignment_problem
dbr
:Quadratic_knapsack_problem
dbr
:Jack_Edmonds
dbr
:Hungarian_algorithm
dbr
:Snow_plow_routing_problem
dbr
:Edge_cycle_cover
dbr
:Weight_function
dbr
:Dijkstra's_algorithm
dbr
:Assignment_problem
dbr
:B*
dbr
:Greedoid
dbr
:Greedy_randomized_adaptive_search_procedure
dbr
:Change-making_problem
dbr
:Knapsack_problem
dbr
:Weapon_target_assignment_problem
dbr
:European_Chapter_on_Combinatorial_Optimization
dbr
:Extremal_combinatorics
dbr
:Gilbert–Pollack_conjecture
dbr
:Symmetry-breaking_constraints
dbr
:Vertex_k-center_problem
dbr
:Multidimensional_assignment_problem
dbr
:Smallest-circle_problem
dbr
:Submodular_set_function
dbr
:Steiner_travelling_salesman_problem
dbr
:Superadditive_set_function
is
skos:
broader
of
dbc
:Matroid_theory
dbc
:Packing_problems
dbc
:Network_flow_problem
dbc
:Rainbow_problems
dbc
:Optimal_scheduling
dbc
:Number_partitioning
dbc
:Exchange_algorithms
dbc
:Travelling_salesman_problem
dbc
:Linear_programming
dbc
:Scheduling_(computing)
dbc
:Covering_problems
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License