scientific article
From MaRDI portal
Publication:3813613
zbMATH Open0662.90065MaRDI QIDQ3813613FDOQ3813613
Publication date: 1987
Title of this publication is not available (Why is that?)
heuristicpolyhedral combinatoricsperfect matchingsystem of linear inequalitiespolynomial-time algorithmstraveling salesman
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)
Cited In (40)
- On the complexity of quantified linear systems
- The tropical analogue of the Helton-Nie conjecture is true
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
- Stability and stabilization of delay differential systems
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
- An analysis of totally clairvoyant scheduling
- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
- Labelled Calculi for Łukasiewicz Logics
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- \((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems
- Modelization of deterministic rational relations
- Restricted robust uniform matroid maximization under interval uncertainty
- On integer closure in a system of unit two variable per inequality constraints
- Optimal length resolution refutations of difference constraint systems
- Investment evaluation based on the commerical scope. The production of natural gas
- Title not available (Why is that?)
- A polynomial time algorithm for Zero-Clairvoyant scheduling
- A combinatorial algorithm for Horn programs
- A polynomial-time algorithm for computing the yolk in fixed dimension
- Convex Hull of Arithmetic Automata
- On a decision procedure for quantified linear programs
- Integer programming models for round Robin tournaments
- Conic mixed-integer rounding cuts
- A zero-space algorithm for negative cost cycle detection in networks
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Computing a quasi-perfect equilibrium of a two-player game
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems
- Fast polyhedra abstract domain
- A complexity perspective on entailment of parameterized linear constraints
- Farkas Bounds on Horn Constraint Systems
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
- Algorithms for the frame of a finitely generated unbounded polyhedron
- Discrete convexity and equilibria in economies with indivisible goods and money
- An eigenstructure assignment approach for constrained linear continuous-time singular systems
- Lifting, tilting and fractional programming revisited
- Proof search and co-NP completeness for many-valued logics
- On linear programming and matrix scaling over the algebraic numbers
- On integer points in polyhedra: A lower bound
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Analyzing fractional Horn constraint systems
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 Q3813613)
