Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
From MaRDI portal
Recommendations
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- A combinatorial column generation algorithm for the maximum stable set problem
- Probabilistic estimates for the generalized maximum satisfiability problem
- scientific article; zbMATH DE number 69384
- A probabilistic analysis of randomly generated binary constraint satisfaction problems.
- An exact and a randomized approach for the satisfiability problem
- A technical review of column generation in integer programming
- scientific article; zbMATH DE number 1002207
Cites work
- scientific article; zbMATH DE number 4018774 (Why is no real title available?)
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 29203 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 849074 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A linear programming approach to reasoning about probabilities
- Algorithms for the maximum satisfiability problem
- An algebraic synthesis of the foundations of logic and probability
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- Column Generation Methods for Probabilistic Logic
- On Nonlinear Fractional Programming
- Polynomial algorithms for estimating network reliability
- Probabilistic logic
- Probabilistic satisfiability
- Probability logic
- Routing with time windows by column generation
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Tabu Search—Part I
- The Decomposition Algorithm for Linear Programs
- The basic algorithm for pseudo-Boolean programming revisited
Cited in
(11)- Column generation applied to linear programs in course registration
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Cluster analysis and mathematical programming
- A hybrid method for probabilistic satisfiability
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- A further step for efficient corrections of inconsistent probabilistic data sets
- Statistical matching of multiple sources: A look through coherence
- Probabilistic satisfiability with imprecise probabilities
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- Probabilistic satisfiability
- Genetic algorithms and tabu search: Hybrids for optimization
This page was built for publication: Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296804)
