The following pages link to (Q4523706):
Displayed 31 items.
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- Round robin scheduling -- a survey (Q2475809) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
- A class of stochastic programs with decision dependent uncertainty (Q2502206) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Horn representation of a concept lattice (Q3631392) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- Event-Time Models for Supply Chain Scheduling (Q3638506) (← links)
- Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
- Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos (Q4905627) (← links)
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
- Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
- An improved formulation for the multi-depot open vehicle routing problem (Q5964850) (← links)
- Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- Combining optimisation and simulation using logic-based Benders decomposition (Q6087478) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers (Q6099415) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)