scientific article; zbMATH DE number 1234104
From MaRDI portal
Publication:4221106
zbMath0970.90052MaRDI QIDQ4221106
Publication date: 28 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Linear programming (90C05) Number-theoretic algorithms; complexity (11Y16) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear Diophantine equations (11D04)
Related Items
Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes, On minimal positive basis for polyhedral cones in Rn, Mixed-Integer Convex Representability, On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking, On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications, Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources, Robust Models for the Kidney Exchange Problem, Unnamed Item, A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems, Decomposition Branching for Mixed Integer Programming, Unnamed Item, Semi-discrete optimal transport: hardness, regularization and numerical solution, Quantum mechanics of bipartite ribbon graphs: integrality, lattices and Kronecker coefficients, Regularity of powers of cover ideals of bipartite graphs, Coupled-Cluster theory revisited, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, Verification Modulo theories, Torus quotients of some flag varieties, Analysis and Transformation of Constrained Horn Clauses for Program Verification, A new mixed integer programming approach for inverse correspondence analysis, Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics, Uniformly self-justified equilibria, Advances on strictly \(\varDelta \)-modular IPs, On polynomially solvable constrained input selections for fixed and switched linear structured systems, Generation of synchronizing state machines from a transition system: a region-based approach, Counter-cyclical margins for option portfolios, On the Role of a Market Maker in Networked Cournot Competition, A Chinese remainder theorem for partitions, Factorization in monoids by stratification of atoms and the Elliott problem, Enumeration and unimodular equivalence of empty delta-modular simplices, Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity, Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks, Column-convex matrices, \(G\)-cyclic orders, and flow polytopes, A knapsack intersection hierarchy, What Is Known About Vertex Cover Kernelization?, Various approaches to multiobjective linear programming problems with interval costs and interval weights, A characterization of the existence of succinct linear representation of subset-valuations, Making clusterings fairer by post-processing: algorithms, complexity results and experiments, The entropic approach to causal correlations, Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems, On the Combinatorial Diameters of Parallel and Series Connections, Positive Plücker tree certificates for non-realizability, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Dimension results for extremal-generic polynomial systems over complete toric varieties, INTERLEAVING LOGIC AND COUNTING, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, Rescaling Algorithms for Linear Conic Feasibility, The distribution of sandpile groups of random regular graphs, Resolvability of Hamming Graphs, Unnamed Item, On the Computational Complexity of Linear Discrepancy, Communication-Constrained Expansion Planning for Resilient Distribution Systems, A simple polynomial-time rescaling algorithm for solving linear programs, Solving equation systems in ω-categorical algebras, TreeKs: A Functor to Make Numerical Abstract Domains Scalable, Computation of invariants of finite abelian groups, Solving Systems of Linear Inequalities by Bound Propagation, On describing the routing capacity regions of networks, GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY, Fleet management for autonomous vehicles using flows in time-expanded networks, On Proximity for k-Regular Mixed-Integer Linear Optimization, A tight approximation algorithm for the cluster vertex deletion problem, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Unnamed Item, On Subadditive Duality for Conic Mixed-integer Programs, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Construction of invariant polytopic sets with specified complexity, Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty, The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, Explicit robustness and fragility margins for linear discrete systems with piecewise affine control law, Budget-constrained minimum cost flows, Robust approach to restricted items selection problem, A fixed point iterative approach to integer programming and its distributed computation, On the copy complexity of width 3 Horn constraint systems, Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs, Truthful mechanism design for multidimensional scheduling via cycle monotonicity, The iterative step in the linear programming algorithm of N. Karmarkar, A polyhedral study of production ramping, The submodular joint replenishment problem, Novel results for the anisotropic sparse grid quadrature, The parameterized complexity of geometric graph isomorphism, On integer programming with bounded determinants, The width and integer optimization on simplices with bounded minors of the constraint matrices, Mathematical programming approaches for classes of random network problems, The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties, Robust optimal solutions in interval linear programming with forall-exists quantifiers, Towards an operad-based cryptography: applications of commutative operads, On seminormal monoid rings, Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, Modeling and optimizing traffic light settings in road networks, A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem, A simple arithmetic criterion for graphs being determined by their generalized spectra, Staircase compatibility and its applications in scheduling and piecewise linearization, Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling, Cycles and communicating classes in membrane systems and molecular dynamics, Maximum likelihood estimation in the \(\beta\)-model, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, On minimising the maximum expected verification time, A quantifier-elimination based heuristic for automatically generating inductive assertions for programs, Majorization for partially ordered sets, Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals, Wasserstein distances in the analysis of time series and dynamical systems, A tour of \(M\)-part \(L\)-Sperner families, An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty, New approaches to multi-objective optimization, Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, The power of pyramid decomposition in Normaliz, Orienting rewrite rules with the Knuth-Bendix order., The orbit problem is in the GapL hierarchy, On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times, Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling, A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem, Stability of depth and Cohen-Macaulayness of integral closures of powers of monomial ideals, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Boolean lexicographic optimization: algorithms \& applications, A multi-stage stochastic programming approach in master production scheduling, Characterization of copulas with given diagonal and opposite diagonal sections, A characterization of the 2-additive Choquet integral through cardinal information, Polytopes related to interval vectors and incidence matrices, Computing efficiently the lattice width in any dimension, A multi-objective interpretation of optimal transport, Maximum likelihood estimation in log-linear models, Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms, The two variable per inequality abstract domain, AE solutions and AE solvability to general interval linear systems, On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states, Location-allocation models for traffic police patrol vehicles on an interurban network, Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach, An algorithm to find the lineality space of the positive hull of a set of vectors, Maximizing a sum related to image segmentation evaluation, On the generalized spectral characterizations of Eulerian graphs, Improved approximation algorithms for capacitated fault-tolerant \(k\)-center, Stability of depths of symbolic powers of Stanley-Reisner ideals, A flexible ILP formulation for hierarchical clustering, Intruder deduction problem for locally stable theories with normal forms and inverses, The double pivot simplex method, A \(\min\)-\(\max\) relation in flowgraphs and some applications, FPT-algorithms for some problems related to integer programming, Piercing axis-parallel boxes, Optimal service order for mass-casualty incident response, Integer programming for urban design, Complexity of necessary efficiency in interval linear programming and multiobjective linear programming, Non-reversible betting games on fuzzy events: complexity and algebra, Blowups in tame monomial ideals, On stochastic linear programming problems with the quantile criterion, The coherence of Łukasiewicz assessments is NP-complete, Optimal admissible composition of abstraction heuristics, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, On characterization of the core of lane covering games via dual solutions, Regularity of powers of cover ideals of unimodular hypergraphs, Total dual integrality and integral solutions of the linear complementarity problem, Optimal codon randomization via mathematical programming, Reduction techniques for network validation in systems biology, A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints, Parameterization of positively stabilizing feedbacks for single-input positive systems, Cryptanalysis of a knapsack-based probabilistic encryption scheme, A new upper bound for the cross number of finite Abelian groups., Stability of associated primes of integral closures of monomial ideals, The stable \(b\)-matching polytope revisited, Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems, Integral cycle bases for cyclic timetabling, Integer program with bimodular matrix, Properties of Gomory-Hu co-cycle bases, On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls, On the representability of totally unimodular matrices on bidirected graphs, Fields of algebraic numbers computable in polynomial time. I, On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic, Pivot rules for linear programming: A survey on recent theoretical developments, Toric sets and orbits on toric varieties., Facets of the cone of exact games, On the complexity and approximability of budget-constrained minimum cost flows, Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts, Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty, Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications, Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic, A determinantal formula for circuits of integer lattices, An optimization algorithm based on chaotic behavior and fractal nature, Deformations of dimer models, Adaptive modeling, adaptive data assimilation and adaptive sampling, Enumerating trichromatic triangles containing the origin in linear time, On dominating set of some subclasses of string graphs, Fast and efficient bit-level precision tuning, A unified reproducing kernel gradient smoothing Galerkin meshfree approach to strain gradient elasticity, Two new algorithms for UMTS access network topology design, On lattice point counting in \(\varDelta\)-modular polyhedra, How to find the convex hull of all integer points in a polyhedron?, Polarization in cooperative networks through optimal placement of informed agents, A regularity result for shortest generalized billiard trajectories in convex bodies in \(\mathbb{R}^n\), Total dual dyadicness and dyadic generating sets, An inherently consistent reproducing kernel gradient smoothing framework toward efficient Galerkin meshfree formulation with explicit quadrature, Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability, Perfect fractional matchings in \(k\)-out hypergraphs, Matrices with lexicographically-ordered rows, Subset selection for multiple linear regression via optimization, Optimal constraints aggregation method for ILP, \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited, A feasible rounding approach for mixed-integer optimization problems, Integrality gaps for colorful matchings, On compatible triangulations with a minimum number of Steiner points, On the complexity of quasiconvex integer minimization problem, On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems, Variable neighborhood search for stochastic linear programming problem with quantile criterion, Streaming graph computations with a helpful advisor, Determining the interset distance, Symmetry of eigenvalues of Sylvester matrices and tensors, Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks, Inhomogeneous extreme forms, On the geometry of discrete exponential families with application to exponential random graph models, On mean values of multivariable complex valued multiplicative functions and applications, On the existence of a trivariate copula with given values of a trivariate quasi-copula at several points, The maximum vertex coverage problem on bipartite graphs, Mixed-integer bilevel representability, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, Type and conductor of simplicial affine semigroups, GKZ-hypergeometric systems for Feynman integrals, The main vertices of a star set and related graph parameters, Tree-like unit refutations in Horn constraint systems, The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints, Quantum violation of the suppes-zanotti inequalities and ``contextuality, Simple games versus weighted voting games: bounding the critical threshold value, Constructions of copulas with given diagonal (and opposite diagonal) sections and some generalizations, Flexible resource allocation to interval jobs, On lattice-free orbit polytopes, Facets of the cone of totally balanced games, Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1], Maximum flows in generalized processing networks, An efficient algorithm for deciding vanishing of Schubert polynomial coefficients, Decision support for strategic energy planning: a robust optimization framework, Polyhedral approximations of the semidefinite cone and their application, Equilibrium strategies for multiple interdictors on a common network, Oriented graphs determined by their generalized skew spectrum, An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra, Computing Walrasian equilibria: fast algorithms and structural properties, Random sampling and machine learning to understand good decompositions, Classification of triples of lattice polytopes with a given mixed volume, Polyhedral circuits and their applications, Regularity and Koszul property of symbolic powers of monomial ideals, Black-box combinatorial optimization using models with integer-valued minima, Formal solution of an interval system of linear equations with an application in static responses of structures with interval forces, On the optimal correction of infeasible systems of linear inequalities, A new concave minimization algorithm for the absolute value equation solution, On linear operators preserving certain cones in \(\mathbb{R}^n\), Algorithmic reduction of biological networks with multiple time scales, Semi-automatically optimized calibration of internal combustion engines, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting, Analyzing unit read-once refutations in difference constraint systems, Critical subsystems in time interval models. Application to a baking process, A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption, The Schrijver system of the flow cone in series-parallel graphs, Charging station optimization for balanced electric car sharing, FPT-algorithm for computing the width of a simplex given by a convex hull, Efficient approximation algorithms for maximum coverage with group budget constraints, A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum, Two variations of graph test in double description method, The continuous maximum capacity path interdiction problem, Finding MEMo: minimum sets of elementary flux modes, On cutting planes for cardinality-constrained linear programs, Improved analysis of online balanced clustering, Finitely generated structures computable in polynomial time, Smith normal form and the generalized spectral characterization of graphs, Backdoors to tractable answer set programming, Solving strong controllability of temporal problems with uncertainty using SMT, Flexible proof production in an industrial-strength SMT solver, An efficient subsumption test pipeline for BS(LRA) clauses, Nonlinear desirability as a linear classification problem, An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem, An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint, About the complexity of two-stage stochastic IPs, About the Complexity of Two-Stage Stochastic IPs, On the Complexity of Non-reversible Betting Games on Many-Valued Events, Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for Petri nets, Positroids and non-crossing partitions, Solving Disjunctive Fuzzy Answer Set Programs, Distributed Linear Programming with Event-Triggered Communication, Characteristic function games with restricted agent interactions: core-stability and coalition structures, A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems, Novel geometric approach for virtual coiling, Conflict Resolution, Approximation Algorithms for Multi-budgeted Network Design Problems, Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice, Hadamard triples generate self-affine spectral measures, Regular Matroids Have Polynomial Extension Complexity, Generation of structured meshes in multiply connected surfaces using submapping, Enclosures for the solution set of parametric interval linear systems, Tractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ball, The differential of probabilistic entailment, A Tutorial on Interactive Markov Chains, Evolutionary approach for large-scale mine scheduling, Primary frequency regulation in power grids with on-off loads: chattering, limit cycles and convergence to optimality, On the complexity of finding tensor ranks, On the growth of Lebesgue constants for convex polyhedra, Locally positive stabilization of infinite-dimensional linear systems by state feedback, Varieties of contextuality based on probability and structural nonembeddability, Computability of validity and satisfiability in probability logics over finite and countable models, Efficient Algorithms for the Consensus Decision Problem, Branch and cut method for solving integer indefinite quadratic bilevel programs, Lonely points in simplices, Lagrangian Duality in Complex Pose Graph Optimization, Facets and facet subgraphs of symmetric edge polytopes, Error bounds and a condition number for the absolute value equations, Certified Hermite matrices from approximate roots, On a Special Co-cycle Basis of Graphs, Ehrhart positivity of Tesler polytopes and Berline-Vergne's valuation, Box-total dual integrality and edge-connectivity, Deciding whether a relation defined in Presburger logic can be defined in weaker logics, Unnamed Item, Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes, Diagonal splittings of toric varieties and unimodularity, Unnamed Item, Splitting the Control Flow with Boolean Flags, On the impossibility of purely algebraic signatures, A simple optimal contention resolution scheme for uniform matroids, Helly’s theorem: New variations and applications, Polyhedral approaches to learning Bayesian networks, Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars, Constraint Satisfaction Problems over Numeric Domains, Bi-criteria and approximation algorithms for restricted matchings, A mathematical programming approach to the construction of BIBDs, An Embarrassingly Parallel Method for Large-Scale Stochastic Programs, How to Block Blood Flow by Using Elastic Coil, The space of compatible full conditionals is a unimodular toric variety, Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models, Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem, On the Identity Problem for the Special Linear Group and the Heisenberg Group., Faster Algorithms for Integer Programs with Block Structure, Phase transitions in integer linear problems, Finding optimal hardware/software partitions, Enumerating Minimal Transversals of Hypergraphs without Small Holes, Modelling start-up costs of multiple technologies in electricity markets, Spectral spaces of countable Abelian lattice-ordered groups, Factorization of singular integer matrices, Approximate Dynamic Programming based on High Dimensional Model Representation, Elimination Techniques for Program Analysis, Subdivisions of toric complexes, Elasticity and Petri Nets, Graph Stabilization: A Survey, A novel analytical integer optimization method for wavelet based subband coding, Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings, Implications of Inverse Parametric Optimization in Model Predictive Control, The strength of multi-row models, Stability of depth functions of cover ideals of balanced hypergraphs, Mixed Integer Linear Programming Formulation Techniques, Existence of unimodular triangulations — positive results, Bijectivity Certification of 3D Digitized Rotations, Regularity radius: Properties, approximation and a not a priori exponential algorithm, A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives, Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF, Speeding up the Constraint-Based Method in Difference Logic, Robust Quadratic Programming with Mixed-Integer Uncertainty, Extending holomorphic maps from Stein manifolds into affine toric varieties, Strong Stability Preserving Explicit Linear Multistep Methods with Variable Step Size, Tolerance analysis in linear systems and linear programming, The Complexity of the Nucleolus in Compact Games, Attacking Letter Substitution Ciphers with Integer Programming, Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems, A Survey of Satisfiability Modulo Theory, Modular SMT Proofs for Fast Reflexive Checking Inside Coq, Reconstructing gas distribution maps via an adaptive sparse regularization algorithm, Efficient Lattice Width Computation in Arbitrary Dimension, On Vertices and Facets of Combinatorial 2-Level Polytopes, A Characterization of Graphs with Fractional Total Chromatic Number Equal to, Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time, Discrete strip-concave functions, Gelfand--Tsetlin patterns, and related polyhedra, Unnamed Item, Certified Hermite Matrices from Approximate Roots - Univariate Case, Parametrization of Plane Irregular Regions: A Semi-automatic Approach I, Unnamed Item, Tight Approximation for Unconstrained XOS Maximization
