Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
From MaRDI portal
Publication:1296804
DOI10.1016/S0377-2217(97)00059-3zbMath0932.90027MaRDI QIDQ1296804
Brigitte Jaumard, Pierre Hansen, Marcus V. Poggi de Aragão
Publication date: 14 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
linear programmingcolumn generationmixed-integer programmingmaximum satisfiabilityprobabilistic satisfiability
Related Items
Characterizing consistency in probabilistic logic for a class of Horn clauses, Genetic algorithms and tabu search: Hybrids for optimization, Statistical matching of multiple sources: A look through coherence, Cluster analysis and mathematical programming, Column generation applied to linear programs in course registration, A further step for efficient corrections of inconsistent probabilistic data sets, Probabilistic satisfiability with imprecise probabilities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the maximum satisfiability problem
- Probability logic
- Probabilistic logic
- An algebraic synthesis of the foundations of logic and probability
- Probabilistic satisfiability
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- A linear programming approach to reasoning about probabilities
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- The basic algorithm for pseudo-Boolean programming revisited
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- Routing with time windows by column generation
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Polynomial algorithms for estimating network reliability
- Tabu Search—Part I
- Column Generation Methods for Probabilistic Logic
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Best Possible Inequalities for the Probability of a Logical Function of Events
- On Nonlinear Fractional Programming