A linear-time transformation of linear inequalities into conjunctive normal form (Q293409): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results and experiments in programming techniques for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Programming Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for the radio link frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear approach to a class of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential reduction approach to the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact normal forms in propositional logic and integer programming formulations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:38, 12 July 2024

scientific article
Language Label Description Also known as
English
A linear-time transformation of linear inequalities into conjunctive normal form
scientific article

    Statements

    Identifiers