Mixed logical-linear programming
From MaRDI portal
Publication:1961464
DOI10.1016/S0166-218X(99)00100-6zbMath0945.90031OpenAlexW2134094348MaRDI QIDQ1961464
Publication date: 11 October 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00100-6
Related Items
Constraint programming and operations research, Submodularity and its application to some global constraints, Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, A branch and efficiency algorithm for the optimal design of supply chain networks, Global optimization of disjunctive programs, Hybrid model predictive control of a solar air conditioning plant, A conflict-directed approach to chance-constrained mixed logical linear programming, Best subset selection via cross-validation criterion, A polyhedral approach to the \textit{alldifferent} system, Logic cuts for multilevel generalized assignment problems., Semiring programming: a semantic framework for generalized sum product problems, On solving the progressive party problem as a MIP., Second-order cover inequalities, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos, An interleaved depth-first search method for the linear optimization problem with disjunctive constraints, Zero duality gap in surrogate constraint optimization: a concise review of models, Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Searching for mutually orthogonal Latin squares via integer and constraint programming, Solving linear programs with complementarity constraints using branch-and-cut, Mixed Integer Linear Programming Formulation Techniques, Modelling either-or relations in integer programming, Mixed global constraints and inference in hybrid CLP--IP solvers, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Uses Software
Cites Work
- On finding solutions for extended Horn formulas
- Compact normal forms in propositional logic and integer programming formulations
- Generating cuts in integer programming with families of special ordered sets
- The intractability of resolution
- Representability in mixed integer programming. I: Characterization results
- An algorithm for solving large capacitated warehouse location problems
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Some results and experiments in programming techniques for propositional logic
- An optimal k-consistency algorithm
- Logic applied to integer programming and integer programming applied to logic
- An algorithm for disjunctive programs
- Detecting embedded Horn structure in propositional logic
- Logic-based decision support. Mixed integer model formulation
- Fourier-Motzkin elimination extension to integer programming problems
- A note on duality in disjunctive programming
- Logic cuts for processing networks with fixed charges
- An alternative explanation of disjunctive formulations
- Generalized resolution for 0--1 linear inequalities
- On renamable Horn and generalized Horn functions
- Logic-based Benders decomposition
- The arborescence-realization problem
- Logic-based 0-1 constraint programming
- Testing heuristics: We have it all wrong
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
- Modelling with integer variables
- A Way to Simplify Truth Functions
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Input Proofs and Rank One Cutting Planes
- Surrogate Constraint Duality in Mathematical Programming
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Disjunctive Programming
- Extended Horn sets in propositional logic
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- A Machine-Oriented Logic Based on the Resolution Principle
- The Problem of Simplifying Truth Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
