Parameterized shifted combinatorial optimization (Q5915595): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6991678
scientific article; zbMATH DE number 6796727
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1434.90167 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-62389-4_19 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
23 October 2017
Timestamp+2017-10-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 October 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q19 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6796727 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594848484 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3172969885 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62044459 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62044469 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.06844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum vulnerability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elections with Few Candidates: Prices, Weights, and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5275386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Grow Low: Shrubs and Fast MSO1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unimodular intersection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta-theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of an MSO-Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted matroid optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer convex minimization by mixed integer linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths with minimum shared edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a collective set of items: from proportional multirepresentation to group recommendation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:01, 17 July 2024

scientific article; zbMATH DE number 6796727
Language Label Description Also known as
English
Parameterized shifted combinatorial optimization
scientific article; zbMATH DE number 6796727

    Statements

    Parameterized shifted combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2018
    0 references
    23 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    shifted problem
    0 references
    treewidth
    0 references
    MSO logic
    0 references
    MSO partitioning
    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