Discrete extremal problems (Q1152306): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3889204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Assignment Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the truncated assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex polyhedra of doubly stochastic matrices III. Affine and combinatorial properties of \(\Omega\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex polyhedra of doubly stochastic matrices. IV / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modules unimodulaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Unimodularity of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Stability Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear lower bound on linear search tree programs for solving knapsack-problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving a Resource Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for solving a certain class of linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial linear characterizations of the asymmetric travelling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor relations on the convex of cyclic permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear systems with integral valued solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur mathematischen theorie der optimalen standardisierung / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Mappings into n-Cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid intersection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemann's hypothesis and tests for primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the total unimodularity of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem and a class of polyhedra of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving simultaneous positivity of linear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing graph properties from adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Perfect Graph Conjecture for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class Of Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Extreme Points / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:14, 13 June 2024

scientific article
Language Label Description Also known as
English
Discrete extremal problems
scientific article

    Statements

    Discrete extremal problems (English)
    0 references
    0 references
    1981
    0 references
    discrete extremal problems
    0 references
    heuristic algorithms
    0 references
    polynomial completeness
    0 references
    bottleneck optimization
    0 references
    stability
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references