Mixed logical-linear programming
From MaRDI portal
DOI10.1016/S0166-218X(99)00100-6zbMATH Open0945.90031OpenAlexW2134094348MaRDI QIDQ1961464FDOQ1961464
Authors: Yanyan Li 
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
Recommendations
Cites Work
- Testing heuristics: We have it all wrong
- An algorithm for solving large capacitated warehouse location problems
- Generalized resolution for 0--1 linear inequalities
- Logic-based Benders decomposition
- A Way to Simplify Truth Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- The Problem of Simplifying Truth Functions
- Title not available (Why is that?)
- Modelling with integer variables
- Disjunctive Programming
- A Machine-Oriented Logic Based on the Resolution Principle
- Some results and experiments in programming techniques for propositional logic
- Compact normal forms in propositional logic and integer programming formulations
- An algorithm for disjunctive programs
- Title not available (Why is that?)
- Surrogate Constraint Duality in Mathematical Programming
- The intractability of resolution
- An optimal k-consistency algorithm
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- On finding solutions for extended Horn formulas
- Representability in mixed integer programming. I: Characterization results
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- Logic-based decision support. Mixed integer model formulation
- Title not available (Why is that?)
- Input Proofs and Rank One Cutting Planes
- Logic applied to integer programming and integer programming applied to logic
- Detecting embedded Horn structure in propositional logic
- Extended Horn sets in propositional logic
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Fourier-Motzkin elimination extension to integer programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on duality in disjunctive programming
- On renamable Horn and generalized Horn functions
- The arborescence-realization problem
- An alternative explanation of disjunctive formulations
- Generating cuts in integer programming with families of special ordered sets
- Logic-based 0-1 constraint programming
- Logic cuts for processing networks with fixed charges
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
- Title not available (Why is that?)
Cited In (30)
- Many-valued logic and mixed integer programming
- Hybrid model predictive control of a solar air conditioning plant
- Solving linear programs with complementarity constraints using branch-and-cut
- Title not available (Why is that?)
- Global optimization of disjunctive programs
- Constraint programming and operations research
- Ahybrid model (MILP-CLP) to pipeline operational scheduling
- On solving the progressive party problem as a MIP.
- Semiring programming: a semantic framework for generalized sum product problems
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Second-order cover inequalities
- A branch and efficiency algorithm for the optimal design of supply chain networks
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Modelling either-or relations in integer programming
- Mixed integer linear programming formulation techniques
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- A polyhedral approach to the \textit{alldifferent} system
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- Submodularity and its application to some global constraints
- Logic cuts for multilevel generalized assignment problems.
- Best subset selection via cross-validation criterion
- Global and preference-based optimization with mixed variables using piecewise affine surrogates
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Mixed global constraints and inference in hybrid CLP--IP solvers
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A conflict-directed approach to chance-constrained mixed logical linear programming
Uses Software
This page was built for publication: Mixed logical-linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961464)
