scientific article; zbMATH DE number 3185974
From MaRDI portal
Publication:5722271
zbMath0114.25102MaRDI QIDQ5722271
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland, Polyhedral proof methods in combinatorial optimization, Discrepancy of set-systems and matrices, Flots et tensions dans un graphe, Dioïds and semirings: Links to fuzzy sets and other applications, Recent progress on combinatorics and algorithms for low discrepancy roundings, A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem, Totally balanced and totally unimodular matrices defined by center location problems, Exploiting complete linear descriptions for decentralized power market problems with integralities, Total unimodularity and the Euler-subgraph problem, Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT, Recoverable robust representatives selection problems with discrete budgeted uncertainty, Staircase compatibility and its applications in scheduling and piecewise linearization, Directed submodularity, ditroids and directed submodular flows, An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, On total unimodularity of edge-edge adjacency matrices, Robust recoverable and two-stage selection problems, A compact reformulation of the two-stage robust resource-constrained project scheduling problem, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS, LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS, An integral LP relaxation for a drayage problem, Integrality in the multinetwork min‐cost equal‐flow problem, Relaxations for two-level multi-item lot-sizing problems, Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics, Partial Colorings of Unimodular Hypergraphs, The Mixing Set with Divisible Capacities, Complement total unimodularity, Tool switching problems in the context of overlay printing with multiple colours, Block-structured integer programming: can we parameterize without the largest coefficient?, Implementation of a unimodularity test, Balanced matrices, Good and nice colorings of balanced hypergraphs, Totally unimodular stochastic programs, Fixed-charge transportation on a path: optimization, LP formulations and separation, Structural properties and recognition of restricted and strongly unimodular matrices, Optimal mechanism design for the private supply of a public good, Chromatic optimisation: Limitations, objectives, uses, references, A characterization of unimodular orientations of simple graphs, Schottky algorithms: Classical meets tropical, On pseudomatroid property of matrices, Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra, A decomposition of strongly unimodular matrices into incidence matrices of digraphs, Characterization of Totally Unimodular Matrices, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Linear time algorithms for generalized edge dominating set problems, Convex hull results for generalizations of the constant capacity single node flow set, Semidefinite optimization in discrepancy theory, Decision support for strategic energy planning: a robust optimization framework, Totally unimodular multistage stochastic programs, Box-total dual integrality, box-integrality, and equimodular matrices, On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank, Minimizing the number of apertures in multileaf collimator sequencing with field splitting, On some characterisations of totally unimodular matrices, Red-blue covering problems and the consecutive ones property, Forbidden configurations, discrepancy and determinants, Optimisation and hypergraph theory, Rooted \(k\)-connections in digraphs, On the representability of totally unimodular matrices on bidirected graphs, Packing and covering of crossing families of cuts, Balanced \(0,\pm 1\) matrices. I: Decomposition, Graph coloring inequalities from all-different systems, Some sequences associated with combinatorial structures, The integrality number of an integer program
