The following pages link to (Q4523706):
Displaying 50 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- Combined planning and scheduling in a divergent production system with co-production: a case study in the lumber industry (Q632662) (← links)
- A combined CLP-MILP approach for scheduling commodities in a pipeline (Q633547) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← links)
- A hybrid method for the planning and scheduling (Q850451) (← links)
- An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
- Scheduling and routing of automated guided vehicles: A hybrid approach (Q858276) (← links)
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem (Q1634095) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Optimizing the supply chain configuration for make-to-order manufacturing (Q1926828) (← links)
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems (Q1951176) (← links)
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- Transmission network investment using incentive regulation: a disjunctive programming approach (Q2031209) (← links)
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- A robust disaster preparedness model for effective and fair disaster response (Q2273905) (← links)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- Submodularity and its application to some global constraints (Q2364363) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Proving Arrow's theorem by \texttt{PROLOG} (Q2385186) (← links)
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
- A polyhedral approach to the \textit{alldifferent} system (Q2429475) (← links)
- Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
- Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
