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