Combinatorial optimization. Polyhedra and efficiency (3 volumes)

zbMath1041.90001MaRDI QIDQ1854113

Alexander Schrijver

Publication date: 27 January 2003

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization; polyhedral combinatorics; efficient algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

52B55: Computational aspects related to convexity

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

05B35: Combinatorial aspects of matroids and geometric lattices

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints, Copositive programming motivated bounds on the stability and the chromatic numbers, Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization, Evolutionary algorithms and matroid optimization problems, Canonical representations of discrete curves, Data relaying with constraints in hierarchical sensor networks, The shortest multipaths problem in a capacitated dense channel, Design of survivable IP-over-optical networks, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, Source location with rigidity and tree packing requirements, On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Approximate min-max relations for odd cycles in planar graphs, Pre-emptive scheduling problems with controllable processing times, The complexity of mean flow time scheduling problems with release times, Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm, \(h\)-polynomials via reduced forms, Interval scheduling and colorful independent sets, Packing six \(T\)-joins in plane graphs, Finding small stabilizers for unstable graphs, Lower bounds on the sizes of integer programs without additional variables, Simple extensions of polytopes, An infinite family of excluded minors for strong base-orderability, Entropy of symmetric graphs, Fair assignment of indivisible objects under ordinal preferences, Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs, The complexity of recognizing linear systems with certain integrality properties, On short paths interdiction problems: Total and node-wise limited interdiction, Two-dimensional packing with conflicts, Generating cut conjunctions in graphs and related problems, Preemptive scheduling on uniform parallel machines with controllable job processing times, Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach, Source location in undirected and directed hypergraphs, Cyclic games and linear programming, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, Total domination of graphs and small transversals of hypergraphs, The stable set polytope of quasi-line graphs, Finding coherent cyclic orders in strong digraphs, George Dantzig's impact on the theory of computation, On the \(p\)-median polytope of \(Y\)-free graphs, The travelling preacher, projection, and a lower bound for the stability number of a graph, The \(k\)-path tree matroid and its applications to survivable network design, Extremal perfect graphs for a bound on the domination number, An algorithm to increase the node-connectivity of a digraph by one, Polymatroids and mean-risk minimization in discrete optimization, Pin-collinear body-and-pin frameworks and the molecular conjecture, On cardinality constrained cycle and path polytopes, Facets of the \((s,t)-p\)-path polytope, Induced disjoint paths problem in a planar digraph, A note on kernels and Sperner's Lemma, The expressive power of binary submodular functions, Global optimization for first order Markov random fields with submodular priors, Approximating the maximum 2- and 3-edge-colorable subgraph problems, An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths, A cubic kernel for feedback vertex set and loop cutset, Graph edge colouring: Tashkinov trees and Goldberg's conjecture, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The college admissions problem with lower and common quotas, The parity problem of polymatroids without double circuits, Network flow interdiction on planar graphs, A note on some collapse results of valued constraints, Precoloring extension of co-Meyniel graphs, Submodular function minimization, The stable set polytope for some extensions of \(P_4\)-free graphs, Block-diagonal semidefinite programming hierarchies for 0/1 programming, On a theorem of Sewell and Trotter, Integer version of the multipath flow network synthesis problem, The box-TDI system associated with 2-edge connected spanning subgraphs, Better bounds for minimizing SONET ADMs, The subdivision-constrained minimum spanning tree problem, Minimizing the stabbing number of matchings, trees, and triangulations, Minimum mean cycle problem in bidirected and skew-symmetric graphs, Weighted restricted 2-matching, Pure Nash equilibria in player-specific and weighted congestion games, Packing trees with constraints on the leaf degree, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Computing monotone disjoint paths on polytopes, A geometric characterization of ``optimality-equivalent relaxations, A faster strongly polynomial time algorithm for submodular function minimization, Multiline addressing by network flow, On Kalai's conjectures concerning centrally symmetric polytopes, On minimum \(k\)-modal partitions of permutations, The \(S\)-digraph optimization problem and the greedy algorithm, Statistics to measure correlation for data mining applications, Greedily constructing maximal partial \(f\)-factors, Rooted \(k\)-connections in digraphs, Minimum-weight cycle covers and their approximability, Approximation algorithms for the weighted independent set problem in sparse graphs, Constrained inverse min-max spanning tree problems under the weighted Hamming distance, Weighted sum coloring in batch scheduling of conflicting jobs, Approximating the maximum internal spanning tree problem, A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids, Covering skew-supermodular functions by hypergraphs of minimum total size, Optimizing the marriage market: an application of the linear assignment model, Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs, Flows with unit path capacities and related packing and covering problems, Ehrhart polynomials of matroid polytopes and polymatroids, Stable sets, corner polyhedra and the Chvàtal closure, Approximating the maximum 3-edge-colorable subgraph problem, Tight spans of distances and the dual fractionality of undirected multiflow problems, Degree-constrained graph orientation: maximum satisfaction and minimum violation, Combinatorial EM algorithms, Optimum matchings in weighted bipartite graphs, Zonotopal algebra and forward exchange matroids, Non-archimedean valuations of eigenvalues of matrix polynomials, On the diameter of cut polytopes, Weighted digraphs and tropical cones, Edge-disjoint odd cycles in 4-edge-connected graphs, House-swapping with divorcing and engaged pairs, Core-based criterion for extreme supermodular functions, Equistarable bipartite graphs, Deciding probabilistic automata weak bisimulation: theory and practice, On the diameter of lattice polytopes, Robust probability updating, Parameter-free sampled fictitious play for solving deterministic dynamic programming problems, Approximation algorithms for stochastic combinatorial optimization problems, Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming, Optimal cost sharing for capacitated facility location games, Edge-disjoint rainbow spanning trees in complete graphs, The complexity of finding arc-disjoint branching flows, A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges, A survey on flows in graphs and matroids, An inductive construction of minimally rigid body-hinge simple graphs, Matroid and knapsack center problems, Modelling practical placement of trainee teachers to schools, Stronger bounds and faster algorithms for packing in generalized kernel systems, On the number of matroids, Approximations for constructing tree-form structures using specific material with fixed length, Packing non-zero \(A\)-paths via matroid matching, Inverse chromatic number problems in interval and permutation graphs, An alternative approach for proving the NP-hardness of optimization problems, Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network, A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design, An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension, A branch-and-bound algorithm for the acyclic partitioning problem, A two-stage decomposition of high school timetabling applied to cases in Denmark, Extended formulations for independence polytopes of regular matroids, Approximation algorithms for inventory problems with submodular or routing costs, Irrelevant vertices for the planar disjoint paths problem, On discrete optimization with ordering, Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter, Computing pure Nash and strong equilibria in bottleneck congestion games, On generalizations of network design problems with degree bounds, Testing additive integrality gaps, Lifted generalized permutahedra and composition polynomials, A bilevel programming problem with maximization of a supermodular function in the lower level, Edge-colouring and total-colouring chordless graphs, Three-matching intersection conjecture for perfect matching polytopes of small dimensions, Majorization for partially ordered sets, A game generalizing Hall's theorem, Oriented hypergraphs: introduction and balance, A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees, On the polyhedral structure of uniform cut polytopes, Characterizing and recognizing generalized polymatroids, New approaches to multi-objective optimization, Thresholded covering algorithms for robust and max-min optimization, Combinatorial optimization with one quadratic term: spanning trees and forests, Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, Minimum \(d\)-blockers and \(d\)-transversals in graphs, Optimality conditions for a bilevel matroid problem, Tree-representation of set families and applications to combinatorial decompositions, Coloring fuzzy circular interval graphs, Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences, Series-parallel orientations preserving the cycle-radius, Bonds with parity constraints, On flows in simple bidirected and skew-symmetric networks, Packing cycles exactly in polynomial time, Immersing complete digraphs, Aggregation of monotone reciprocal relations with application to group decision making, Solving VLSI design and DNA sequencing problems using bipartization of graphs, The \(k\) edge-disjoint 3-hop-constrained paths polytope, Cutting stock with no three parts per pattern: work-in-process and pattern minimization, Online variable-sized bin packing with conflicts, On claw-free \(t\)-perfect graphs, Fractional packing in ideal clutters, Notes on the deficiency-one theorem: multiple linkage classes, Ideal multipartite secret sharing schemes, Operations research in the space industry, On the complexity of the Eulerian closed walk with precedence path constraints problem, The root location problem for arc-disjoint arborescences, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, On the computational complexity of membership problems for the completely positive cone and its dual, Hamilton cycles in dense vertex-transitive graphs, An algorithm for weighted fractional matroid matching, Tree metrics and edge-disjoint \(S\)-paths, Certifying algorithms, Spectral bounds for the independence ratio and the chromatic number of an operator, Exact and asymptotic results on coarse Ricci curvature of graphs, Polyhedral study of the connected subgraph problem, Criticality for multicommodity flows, Belief propagation for optimal edge cover in the random complete graph, A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching, On packing arborescences in temporal networks, Systems of equations with a single solution, Handelman's hierarchy for the maximum stable set problem, On the proper orientation number of bipartite graphs, Assigning agents to a line, Towards optimal and expressive kernelization for \(d\)-hitting set, Resource buying games, A note on submodular set cover on matroids, Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor, Odd-\(K_{4}\)'s in stability critical graphs, Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid, On return path packing., A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem., More complete intersection theorems, Uniqueness of equilibria in atomic splittable polymatroid congestion games, The weakly connected independent set polytope in corona and join of graphs, On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications, Constant factor approximation for the weighted partial degree bounded edge packing problem, The mixed evacuation problem, Algorithms for detecting dependencies and rigid subsystems for CAD, Schubert polynomials as integer point transforms of generalized permutahedra, Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces, Linkage on the infinite grid, Belief propagation for the maximum-weight independent set and minimum spanning tree problems, Matroid optimisation problems with nested non-linear monomials in the objective function, Costly circuits, submodular schedules and approximate Carathéodory theorems, On the approximability of the maximum interval constrained coloring problem, Discrete convexity in joint winner property, Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling, Rainbow spanning trees in properly coloured complete graphs, On the Langberg-Médard multiple unicast conjecture, Algebraic matroids and Frobenius flocks, On box-perfect graphs, Gross substitutability: an algorithmic survey, Domination parameters with number 2: interrelations and algorithmic consequences, On imposing connectivity constraints in integer programs, Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length, A note on counting independent terms in asymptotic expressions of computational complexity, On the information ratio of non-perfect secret sharing schemes, Core index of perfect matching polytope for a 2-connected cubic graph, Coordination mechanisms for scheduling games with proportional deterioration, The search value of a set, Colored spanning graphs for set visualization, Chain-constrained spanning trees, On vertex-parity edge-colorings, Improved bounds for randomized preemptive online matching, Lexicographical polytopes, Minimal arc-sets spanning dicycles, The complexity of the Clar number problem and an exact algorithm, Graphs vertex-partitionable into strong cliques, A logarithmic approximation for polymatroid congestion games, Refuting a conjecture of goemans on bounded degree spanning trees, Polyhedra and parameter spaces for matroids over valuation rings, Efficient algorithms for computing the inner edit distance of a regular language via transducers, Convex equipartitions of colored point sets, Complexity of strict robust integer minimum cost flow problems: an overview and further results, The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut, Antimatroids induced by matchings, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Graph edge coloring: a survey, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Matroid prophet inequalities and applications to multi-dimensional mechanism design, Top-\(k\) overlapping densest subgraphs, A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions, On the intersection of infinite matroids, A tropical isoperimetric inequality, A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures, On matrices with the Edmonds-Johnson property arising from bidirected graphs, A simple proof characterizing interval orders with interval lengths between 1 and \(k\), Two new reformulation convexification based hierarchies for 0-1 MIPs, Weighted matching with pair restrictions, An improved approximation algorithm for knapsack median using sparsification, Supermodular covering knapsack polytope, Efficient approximation schemes for economic lot-sizing in continuous time, Polyhedral studies of vertex coloring problems: the standard formulation, On the mixed set covering, packing and partitioning polytope, Blocking unions of arborescences, Polynomial kernels for deletion to classes of acyclic digraphs, Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs, Buyback problem with discrete concave valuation functions, Blocking optimal structures, Exact algorithms for the equitable traveling salesman problem, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, A geometric approach to the stabilisation of certain sequences of Kronecker coefficients, Approximation algorithms for the max-buying problem with limited supply, Designing matching mechanisms under constraints: an approach from discrete convex analysis, New linearizations of quadratic assignment problems, The diameters of network-flow polytopes satisfy the Hirsch conjecture, A short convex-hull proof for the all-different system with the inclusion property, Flow-based formulations for operational fixed interval scheduling problems with random delays, Extended formulations for vertex cover, Optimization algorithms for the disjunctively constrained knapsack problem, Perfectness of clustered graphs, \(k\)-trails: recognition, complexity, and approximations, Stabilizing network bargaining games by blocking players, Perturbation of eigenvalues of matrix pencils and the optimal assignment problem, 2-balanced flows and the inverse 1-median problem in the Chebyshev space, The dominance assignment problem, Lattice polyhedra and submodular flows, Robustness of minimum cost arborescences, Equivalence of convex minimization problems over base polytopes, Matroid rank functions and discrete concavity, Shortest bibranchings and valuated matroid intersection, A tale of three eras: the discovery and rediscovery of the Hungarian method, On tight spans for directed distances, Between a rock and a hard place: the two-to-one assignment problem, The number of 3-SAT functions, The representation polyhedron of a semiorder., An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem, Games induced by the partitioning of a graph, Metric packing for \(K_ 3 + K_ 3\), Explicit convex and concave envelopes through polyhedral subdivisions, Polyhedron of triangle-free simple 2-matchings in subcubic graphs, Constructing the R* consensus tree of two trees in subcubic time, Face numbers of centrally symmetric polytopes produced from Split graphs, Lattices, graphs, and Conway mutation, Associated primes of powers of edge ideals, Ranking tournaments with no errors. II: Minimax relation, New solution approaches for the maximum-reliability stochastic network interdiction problem, Checking deadlock-freedom of parametric component-based systems, Membership criteria and containments of powers of monomial ideals, Depth and regularity of monomial ideals via polarization and combinatorial optimization, Hypergraph polynomials and the Bernardi process, From generalized permutahedra to Grothendieck polynomials via flow polytopes, Population monotonic allocation schemes for vertex cover games, On the approximate compressibility of connected vertex cover, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, Convergence and correctness of belief propagation for the Chinese postman problem, An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes, Combinatorics of unavoidable complexes, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, Optimal collusion-resistant mechanisms with verification, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Relationship of two formulations for shortest bibranchings, Representative families for matroid intersections, with applications to location, packing, and covering problems, Routing automated lane-guided transport vehicles in a warehouse handling returns, Algorithms and complexity for a class of combinatorial optimization problems with labelling, Optimal matroid partitioning problems, Dispersing obnoxious facilities on a graph, Independent sets and hitting sets of bicolored rectangular families, Integer point enumeration on independence polytopes and half-open hypersimplices, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Lattice polytopes from Schur and symmetric Grothendieck polynomials, Algorithms for hierarchical and semi-partitioned parallel scheduling, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Co-density and fractional edge cover packing, Bit threads and holographic monogamy, The distance-constrained matroid median problem, On some graph classes related to perfect graphs: a survey, Minimal graphs for 2-factor extension, Packing of arborescences with matroid constraints via matroid intersection, Matching fields and lattice points of simplices, Decorous combinatorial lower bounds for row layout problems, Structural properties of feasible bookings in the European entry-exit gas market system, Stochastic packing integer programs with few queries, The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm, The \(b\)-branching problem in digraphs, Optimizing social welfare for network bargaining games in the face of instability, greed and idealism, \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space, On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity, The impact of potential-based physics models on pricing in energy networks, A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption, Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs, A note on M-convex functions on jump systems, Integer programming ensemble of temporal relations classifiers, On the edge capacitated Steiner tree problem, A constant FPT approximation algorithm for hard-capacitated \(k\)-means, Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals, Shorter tours and longer detours: uniform covers and a bit beyond, New polyhedral and algorithmic results on greedoids, A constrained two-stage submodular maximization, Minimum degree conditions for monochromatic cycle partitioning, Bounds for the static permutation mastermind game, Packing branchings under cardinality constraints on their root sets, On a weighted linear matroid intersection algorithm by deg-det computation, The salesman's improved tours for fundamental classes, An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Definite determinantal representations via orthostochastic matrices, Dijkstra's algorithm and L-concave function maximization, Preemptive and non-preemptive generalized min sum set cover, Polynomial time complexity of edge colouring graphs with bounded colour classes, Another note on Dilworth's decomposition theorem., The skeleton of acyclic Birkhoff polytopes, A bound for the number of vertices of a polytope with applications, On the notion of generalized minor in topological network theory and matroids, Bargaining dynamics in exchange networks, Approximation algorithms for constructing some required structures in digraphs, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, A combinatorial approach to nonlocality and contextuality, Algorithms for core stability, core largeness, exactness, and extendability of flow games, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, A fast algorithm for the path 2-packing problem, On the computational complexity of weighted voting games, Recognizing Helly edge-path-tree graphs and their clique graphs, A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks, Facial structures of lattice path matroid polytopes, Minimum cost stability in exchange networks, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Popular matchings with two-sided preference lists and matroid constraints, Nontrivial path covers of graphs: existence, minimization and maximization, Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem, Integrality gap of the vertex cover linear programming relaxation, A note on selective line-graphs and partition colorings, Cospectral pairs of regular graphs with different connectivity, On ideal semicomplete digraphs, Game-theoretic derivation of upper hedging prices of multivariate contingent claims and submodularity, Simultaneous approximation of multi-criteria submodular function maximization, Coloring perfect graphs with no balanced skew-partitions, Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems, Data aggregation for \(p\)-median problems, A novel probabilistic formulation for locating and sizing emergency medical service stations, LP-based covering games with low price of anarchy, On the geometric rank of matching polytope, A framework of discrete DC programming by discrete convex analysis, A faster algorithm for packing branchings in digraphs, On finding orientations with the fewest number of vertices with small out-degree, On the generality of the greedy algorithm for solving matroid base problems, On cardinality constrained polymatroids, Minimum many-to-many matchings for computing the distance between two sequences, On the choosability of claw-free perfect graphs, Theta rank, levelness, and matroid minors, Security games on matroids, Blocking optimal arborescences, Shortcutting directed and undirected networks with a degree constraint, Discriminative measures for comparison of phylogenetic trees, Bounds on the number of connected components for tropical prevarieties, The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, Finding a shortest non-zero path in group-labeled graphs via permanent computation, Transformation and decomposition of clutters into matroids, On positive-influence target-domination, Efficient stabilization of cooperative matching games, Multicommodity flow in trees: packing via covering and iterated relaxation, A 2-approximation for the maximum satisfying bisection problem, Kidney exchange: an egalitarian mechanism, An \(s\)-\(t\) connection problem with adaptability, What the transportation problem did for me, A proof of the molecular conjecture, Budgeted matching and budgeted matroid intersection via the gasoline puzzle, Permutation betting markets: singleton betting with extra information, Treewidth computations. II. Lower bounds, Matching interdiction, Induced graph packing problems, Classes of submodular constraints expressible by graph cuts, Cubic time recognition of cocircuit graphs of uniform oriented matroids, Cop-robber guarding game with cycle robber-region, Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication, Covering directed graphs by in-trees, Partitioning bispanning graphs into spanning trees, Approximating the chromatic index of multigraphs, On the complexity of reconfiguration problems, Graph coloring with rejection, Biorders with frontier, Graph problems arising from parameter identification of discrete dynamical systems, Complexity evaluation of benchmark instances for the \(p\)-median problem, Matroids on convex geometries: subclasses, operations, and optimization, Approximation algorithms for the interval constrained coloring problem, Paths, trees and matchings under disjunctive constraints, Hybrid tractability of valued constraint problems, An efficient scaling algorithm for the minimum weight bibranching problem, Computing solutions for matching games, The hardness of routing two pairs on one face, Ehrhart theory, modular flow reciprocity, and the Tutte polynomial, On the complexity of submodular function minimisation on diamonds, On the max coloring problem, When LP is the cure for your matching woes: improved bounds for stochastic matchings, A rooted-forest partition with uniform vertex demand, Match twice and stitch: a new TSP tour construction heuristic., The affine representation theorem for abstract convex geometries, How to allocate review tasks for robust ranking, What is on his mind?, Maximum weight independent sets in hole- and dart-free graphs, Dense and sparse graph partition, A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors, Hyperbolic set covering problems with competing ground-set elements, Structural and algorithmic properties for parametric minimum cuts, A flow model based on polylinking system, Inequality and network structure, Clustering with lower-bounded sizes. A general graph-theoretic framework, Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity, Covering triangles in edge-weighted graphs, On the shadow simplex method for curved polyhedra, The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths, Characterization of facets of the hop constrained chain polytope via dynamic programming, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, Smallest compact formulation for the permutahedron, Extended formulations, nonnegative factorizations, and randomized communication protocols, Uncapacitated flow-based extended formulations, Facets for art gallery problems, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, A linear time approximation algorithm for permutation flow shop scheduling, Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph, Polyhedra with the integer Carathéodory property, Combinatorial optimization with 2-joins, On two restricted ancestors tree problems, Signed analogue of general Kotzig-Lovász decomposition, On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes, Spectral aspects of symmetric matrix signings, Maximizing profits of routing in WDM networks, Computing technical capacities in the European entry-exit gas market is NP-hard, Two disjoint 5-holes in point sets, On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\), Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems, On the feedback vertex set polytope of a series-parallel graph, A note on multiflows and treewidth, On computing minimum\((s,t)\)-cuts in digraphs, Network design with edge-connectivity and degree constraints, No-collision transportation maps, The diameter of the stable marriage polytope: bounding from below, Convergence of the non-uniform physarum dynamics, Short trading cycles: paired kidney exchange with strict ordinal preferences, Coxeter submodular functions and deformations of Coxeter permutahedra, Exact and approximation algorithms for weighted matroid intersection, On power ideals of transversal matroids and their ``parking functions, Stochastic monotonicity from an Eulerian viewpoint, Two variations of graph test in double description method, Interval orders with two interval lengths, Shortest paths with ordinal weights, Skeleton matching polytope: realization and isomorphism, Maximum matching on trees in the online preemptive and the incremental graph models, Polymatroid-based capacitated packing of branchings, Efficient explicit constructions of compartmented secret sharing schemes, Choice functions in the intersection of matroids, On the facial structure of symmetric and graphical traveling salesman polyhedra, Approximate tradeoffs on weighted labeled matroids, Alternative formulations for the ordered weighted averaging objective, Approximating minimum-cost connected \(T\)-joins, Worst case compromises in matroids with applications to the allocation of indivisible goods, Approximation algorithms for clique transversals on some graph classes, Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes, Revenue maximization with a single sample, Systems of distant representatives in Euclidean space, Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties, The \(k\)-separator problem: polyhedra, complexity and approximation results, Subdivision schemes, network flows and linear optimization, A characterization of PM-compact Hamiltonian bipartite graphs, Generating subtour elimination constraints for the TSP from pure integer solutions, The no-wait job shop with regular objective: a method based on optimal job insertion, On degree sequences of undirected, directed, and bidirected graphs, The replacement principle in networked economies with single-peaked preferences, The rectangle covering number of random Boolean matrices, Polyhedral omega: a new algorithm for solving linear Diophantine systems, Integer round-up property for the chromatic number of some \(h\)-perfect graphs, Characteristic imsets for learning Bayesian network structure, \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs, Minimization of SONET ADMs in ring networks revisited, Least and most colored bases, A network flow algorithm for reconstructing binary images from discrete X-rays, On packing and coloring hyperedges in a cycle, Inverse maximum flow problems under the weighted Hamming distance, Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes, Mechanisms for a spatially distributed market, Packing Steiner trees with identical terminal sets, The rank-width of edge-coloured graphs, Subdivisions in apex graphs, Optimal job insertion in the no-wait job shop, A polynomial time approximation algorithm for the two-commodity splittable flow problem, An adaptive routing approach for personal rapid transit, Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems, On planar valued CSPs, Computing convex hulls and counting integer points with \texttt{polymake}, Fast separation for the three-index assignment problem, Fair splitting of colored paths, An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem, Multicuts in planar and bounded-genus graphs with bounded number of terminals, Pareto optimal matchings with lower quotas, Decomposition theorems for square-free 2-matchings in bipartite graphs, Modularity and greed in double auctions, Degree sequence for \(k\)-arc strongly connected multiple digraphs, Submodular functions: from discrete to continuous domains, Layers and matroids for the traveling salesman's paths, When the Gomory-chvátal closure coincides with the integer hull, A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions, Complexity and approximability of extended spanning star forest problems in general and complete graphs, The vertex \(k\)-cut problem, Additive stabilizers for unstable graphs, Trader multiflow and box-TDI systems in series-parallel graphs, A new approximation hierarchy for polynomial conic optimization, Reconfiguration of maximum-weight \(b\)-matchings in a graph, A generalized-polymatroid approach to disjoint common independent sets in two matroids, Agreeable sets with matroidal constraints, Hitting a path: a generalization of weighted connectivity via game theory, Weighted matching in the semi-streaming model, Maximum series-parallel subgraph, Finding socially best spanning treesî, Balanced matrices, A complete 4-parametric complexity classification of short shop scheduling problems, Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\), Some \(0/1\) polytopes need exponential size extended formulations, Fractional perfect \(b\)-matching polytopes. I: General theory, Optimal mechanism design for the private supply of a public good, Unbounded convex sets for non-convex mixed-integer quadratic programming, On the existence of the positive steady states of weakly reversible deficiency-one mass action systems, A version of Tutte's polynomial for hypergraphs, Computing tropical resultants, A unified approach to distance-two colouring of graphs on surfaces, The covering Canadian traveller problem, Minimal bricks have many vertices of small degree, On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class, Arc-disjoint paths and trees in 2-regular digraphs, Inequalities on submodular functions via term rewriting, Bike sharing systems: solving the static rebalancing problem, Balancing of agricultural census data by using discrete optimization, A simple PTAS for weighted matroid matching on strongly base orderable matroids, A reduction algorithm for the weighted stable set problem in claw-free graphs, The maximum vertex coverage problem on bipartite graphs, Degree bounded matroids and submodular flows, On the toric ideal of a matroid, Network design with a discrete set of traffic matrices, A note on the serial dictatorship with project closures, Kőnig's edge-colouring theorem for all graphs, Toric and tropical compactifications of hyperplane complements, Chromatic Gallai identities operating on Lovász number, Bi-criteria and approximation algorithms for restricted matchings, Approximability of the capacitated \(b\)-edge dominating set problem, On the frontiers of polynomial computations in tropical geometry, The complexity of soft constraint satisfaction, Packing \([1, \Delta \)-factors in graphs of small degree], Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs, Algorithms for time-dependent bicriteria shortest path problems, A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem, Generalizing the induced matching by edge capacity constraints, Polynomiality of sparsest cuts with fixed number of sources, Formulations and exact algorithms for the vehicle routing problem with time windows, Batch processing with interval graph compatibilities between tasks, Matroid matching with Dilworth truncation, Traveling salesman path problems, Sublattices of product spaces: Hulls, representations and counting, On the \(k\) edge-disjoint 2-hop-constrained paths polytope, Linear time algorithms for generalized edge dominating set problems, Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type, Degree constrained subgraphs, A method for approximating symmetrically reciprocal matrices by transitive matrices, Clutter nonidealness, Approximating clique-width and branch-width, New strings for old Veneziano amplitudes. III: Symplectic treatment, Covering partially directed graphs with directed paths, Finding maximum square-free 2-matchings in bipartite graphs, Minimum sum multicoloring on the edges of trees, On global warming: Flow-based soft global constraints, Facets of the independent path-matching polytope, How to recycle your facets, Berge's theorem for the maximum charge problem, MDSM: microarray database schema matching using the Hungarian method, The edge-orientation problem and some of its variants on weighted graphs, On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach, Cycle contraction in oriented graphs, Optimizing compatible sets in wireless networks through integer programming, Note on the spanning-tree packing number of lexicographic product graphs, Packing in generalized kernel systems: a framework that generalizes packing of branchings, Bulk-robust combinatorial optimization, Minimum entropy orientations, Perfect matchings in \(r\)-partite \(r\)-graphs, Multiroute flows: cut-trees and realizability, On cycles and the stable multi-set polytope, A linear programming formulation of Mader's edge-disjoint paths problem, On the complexity of the planar directed edge-disjoint paths problem, A linear programming formulation for the maximum complete multipartite subgraph problem, Mixed integer models for the stationary case of gas network optimization, Approximation algorithms for hard capacitated \(k\)-facility location problems, Metric extension operators, vertex sparsifiers and Lipschitz extendability, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, From generalized permutahedra to Grothendieck polynomials via flow polytopes (extended abstract), Irreducible triangulations of surfaces with boundary, Small Chvátal rank, On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency, Separation, dimension, and facet algorithms for node flow polyhedra, The maximum integer multiterminal flow problem in directed graphs, A survey on the linear ordering problem for weighted or unweighted tournaments, Embedded associated primes of powers of square-free monomial ideals, Intersecting restrictions in clutters, The anisotropic fractional isoperimetric problem with respect to unconditional unit balls, On the convexity of independent set games, A simple algorithm and min-max formula for the inverse arborescence problem, On the extension complexity of scheduling polytopes, Improving on best-of-many-Christofides for \(T\)-tours, The matroid intersection cover problem, Deleting edges to restrict the size of an epidemic in temporal networks, A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion, Multi-hop sensor network scheduling for optimal remote estimation, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Polyhedral Clinching Auctions and the AdWords Polytope, Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity, Algebraic Algorithms for Linear Matroid Parity Problems, Faster Algorithms for Semi-Matching Problems, $h$-Polynomials of Reduction Trees, Capacitated Vehicle Routing with Nonuniform Speeds, Convex Hulls of Algebraic Sets, Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation, Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time, Mixed Integer Linear Programming Formulation Techniques, Expansion planning for waste-to-energy systems using waste forecast prediction sets, Maximal matching polytope in trees, Half-integrality, LP-branching, and FPT Algorithms, Cut Dominants and Forbidden Minors, Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles, Multicommodity flows and cuts in polymatroidal networks, Computing symmetry groups of polyhedra, Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs, Efficient Approximation Algorithms for Weighted $b$-Matching, The Parity Hamiltonian Cycle Problem in Directed Graphs, Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games, On Vertices and Facets of Combinatorial 2-Level Polytopes, Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut, The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness, A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids, Exploiting Symmetries in Polyhedral Computations, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unifying the representation of symmetric crossing families and weakly partitive families, Characterising claw-free t-perfect graphs, Coloring Fuzzy Circular Interval Graphs, An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs, Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation, The positive circuits of oriented matroids with the packing property or idealness, Optimal monotone relabelling of partially non-monotone ordinal data, Matrix Relaxations in Combinatorial Optimization, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time, A Simple Efficient Interior Point Method for Min-Cost Flow, Minimum-cost flow algorithms: an experimental evaluation, Solving Matching Problems Efficiently in Bipartite Graphs, The Generalized Terminal Backup Problem, The Mixed Evacuation Problem, Total Dual Integrality of Triangle Covering, Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem, Performing Multicut on Walkable Environments, LP-Based Algorithms for Capacitated Facility Location, Incremental Network Design with Minimum Spanning Trees, Euler Complexes, A Survey on Covering Supermodular Functions, Recent Developments in Discrete Convex Analysis, Multiflow Feasibility: An Annotated Tableau, Graphic Submodular Function Minimization: A Graphic Approach and Applications, An Introduction to Network Flows over Time, The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract), Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives, Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem, Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract), Clique partitioning of interval graphs with submodular costs on the cliques, On co-bicliques, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, On the cardinality constrained matroid polytope, A Primal-Dual Algorithm for Weighted Abstract Cut Packing, Jump Number of Two-Directional Orthogonal Ray Graphs, Optimal Matching Forests and Valuated Delta-Matroids, Tight Bounds for Linkages in Planar Graphs, $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs, Hamilton cycles in 3-out, Approximating the smallest k -edge connected spanning subgraph by LP-rounding, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Measuring Indifference: Unit Interval Vertex Deletion, TRIANGLE-FREE 2-MATCHINGS REVISITED, On Capacitated Set Cover Problems, Locating Depots for Capacitated Vehicle Routing, Maximum Independent Set in 2-Direction Outersegment Graphs, On integer network synthesis problem with tree-metric cost, Monomial Ideals of Forest Type, Model Checking Probabilistic Systems, Unnamed Item, Unnamed Item, Unnamed Item, The Expressive Power of Binary Submodular Functions, k-Trails: Recognition, Complexity, and Approximations, Stabilizing Network Bargaining Games by Blocking Players, Approximation-Friendly Discrepancy Rounding, Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, An Improved Integrality Gap for Asymmetric TSP Paths, A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes, Finding k Partially Disjoint Paths in a Directed Planar Graph, An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information, Levelness of Order Polytopes, LP Relaxation and Tree Packing for Minimum $k$-Cut, Odd Multiway Cut in Directed Acyclic Graphs, Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction, On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths, Complete Complexity Classification of Short Shop Scheduling, Graphs and Algorithms in Communication Networks on Seven League Boots, BLOBS AND FLIPS ON GEMS, ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID, Algorithms for 3PC(⋅, ⋅)-free Berge graphs, Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors, Streaming Algorithms for Submodular Function Maximization, Identifying Codes in Hereditary Classes of Graphs and VC-Dimension, Matroids of gain graphs in applied discrete geometry, Improved Approximation Algorithms for Stochastic Matching, An Improved Approximation Algorithm for Knapsack Median Using Sparsification, On Element-Connectivity Preserving Graph Simplification, Node-Balancing by Edge-Increments, A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity, Generalized Hypergraph Matching via Iterated Packing and Local Ratio, Tropicalizing the Simplex Algorithm, The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online, Pipe Dream Complexes and Triangulations of Root Polytopes Belong Together, Lehman's Theorem and the Directed Steiner Tree Problem, The Induced Disjoint Paths Problem, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle, Minimum-Weight Cycle Covers and Their Approximability, Covering Directed Graphs by In-Trees, The Secret Santa Problem, Large neighborhood improvements for solving car sequencing problems, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees, Unnamed Item, Tropical Computations in polymake, Computing Weighted Strength and Applications to Partitioning, Small violations of Bell inequalities for multipartite pure random states, All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs, Optimization over Degree Sequences, Necessary conditions for extended noncontextuality in general sets of random variables, Making Bipartite Graphs DM-Irreducible, Extension Complexity of Independent Set Polytopes, Approximating Minimum Cost Connectivity Orientation and Augmentation, The st-bond polytope on series-parallel graphs, Achieving Rental Harmony with a Secretive Roommate, Densities, Matchings, and Fractional Edge-Colorings, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, The Submodular Secretary Problem Goes Linear, On the Metric $s$--$t$ Path Traveling Salesman Problem, Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes, On the Circuit Diameter of Some Combinatorial Polytopes, Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes, Graph Stabilization: A Survey, Expansion and contraction functors on matriods, On Sylvester Colorings of Cubic Graphs, Unnamed Item, Unnamed Item, Unnamed Item, A tutorial on branch and cut algorithms for the maximum stable set problem, Unnamed Item, Unnamed Item, Unnamed Item, Dynamic Atomic Congestion Games with Seasonal Flows, A Lottery Model for Center-Type Problems With Outliers, A Tractable Class of Binary VCSPs via M-Convex Intersection, Implosive graphs: Square-free monomials on symbolic Rees algebras, An Approximation Algorithm for Fully Planar Edge-Disjoint Paths, Unnamed Item, Unnamed Item, Unnamed Item, Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models, Efficient Black-Box Reductions for Separable Cost Sharing, Algorithms as Mechanisms: The Price of Anarchy of Relax and Round, Algorithmic Bayesian Persuasion, A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies, Unnamed Item, Coloring problem of signed interval graphs, Finding a Stable Allocation in Polymatroid Intersection, Unnamed Item, Unnamed Item, Unnamed Item, Efficient Computation of Optimal Auctions via Reduced Forms, Submodular Maximization Through the Lens of Linear Programming, On Submodular Search and Machine Scheduling, An Improved Analysis of Local Search for Max-Sum Diversification, The Euclidean k-Supplier Problem, On the Construction of Substitutes, Collective dynamics of phase-repulsive oscillators solves graph coloring problem, Nowhere–zero bases for the nullspace of the incidence matrices of graphs, Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Hidden Hamiltonian Cycle Recovery via Linear Programming, Assignment Mechanisms Under Distributional Constraints, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees, Learning in Combinatorial Optimization: What and How to Explore, The Optimal Design of Low-Latency Virtual Backbones, A Weighted Linear Matroid Parity Algorithm, A CHARACTERIZATION OF MATROIDS IN TERMS OF SURFACES, Clique-connecting forest and stable set polytopes, Maximum Capacity Path Interdiction Problem with Fixed Costs, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Finding Submodularity Hidden in Symmetric Difference, When Is the Matching Polytope Box-Totally Dual Integral?, Opposite Elements in Clutters, A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem, Robust Randomized Matchings, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Multiple Exchange Property for M^♮-Concave Functions and Valuated Matroids, Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations, Approximation algorithms in combinatorial scientific computing, Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program, Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs, Pareto Stable Matchings under One-Sided Matroid Constraints, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Convexity of graph-restricted games induced by minimum partitions, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, A New Approach to the Pareto Stable Matching Problem, The Nonnegative Node Weight j-Restricted k-Matching Problems, Polynomially Computable Bounds for the Probability of the Union of Events, Some Results about the Contractions and the Pendant Pairs of a Submodular System, The Minimum Weight In-Tree Cover Problem, Transfer Graph Approach for Multimodal Transport Problems, Hamiltonian threshold for strong products of graphs, Spectral bounds for the maximum cut problem, SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION, Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time, Quantitative Analysis under Fairness Constraints, Path Partitions, Cycle Covers and Integer Decomposition, Scheduling Multilayer Divisible Computations, On thef-matching polytope and the fractionalf-chromatic index, Facility Location with Matroid or Knapsack Constraints, Concentration inequalities for nonlinear matroid intersection, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, Parallel algorithms for matroid intersection and matroid parity, Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs, Emerging Behavioral Consensus of Evolutionary Dynamics on Complex Networks, Determining the minimum rank of matroids whose basis graph is common, All Circuits Enumeration in Macro-Econometric Models, STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS, Design of Survivable Networks: A survey, Cop-Robber Guarding Game with Cycle Robber Region, Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth, Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials, $t$-Perfection in $P_5$-Free Graphs, Convergence and Correctness of Max-Product Belief Propagation for Linear Programming, Orientability Thresholds for Random Hypergraphs, Binarisation for Valued Constraint Satisfaction Problems, Some remarks about factors of graphs, Determination of cutoff time for express courier services: a genetic algorithm approach, On the Max Coloring Problem, A Representation Theorem for Union-Difference Families and Application, On the Metric $s$--$t$ Path Traveling Salesman Problem, Unnamed Item, CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM, Semidefinite Descriptions of the Convex Hull of Rotation Matrices, Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition, Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal, Weighted popular matchings, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Chromatic index, treewidth and maximum degree, Fast enumeration algorithms for non-crossing geometric graphs, Finding nucleolus of flow game, Chromatic index, treewidth and maximum degree, Extended formulations in combinatorial optimization, On the equations and classification of toric quiver varieties, A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization, Associated radical ideals of monomial ideals, Extended formulations in combinatorial optimization, Optimality conditions for mixed discrete bilevel optimization problems, Parameterized shifted combinatorial optimization, Online facility assignment, Packing and covering odd cycles in cubic plane graphs with small faces, Approximate proof-labeling schemes, On universal quadratic identities for minors of quantum matrices, Integral packing of branchings in capacitaded digraphs, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, The Power of Recourse for Online MST and TSP, Semidefinite relaxations for partitioning, assignment and ordering problems, The closure of a linear space in a product of lines, Faithful tropicalisation and torus actions, When are multidegrees positive?, Robust Independence Systems, Semidefinite relaxations for partitioning, assignment and ordering problems, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Accelerated Bend Minimization, Generating all vertices of a polyhedron is hard, Budget feasible mechanisms on matroids, A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs, Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces, Bit threads and holographic entanglement of purification