Publication:4523706
From MaRDI portal
zbMath0974.90001MaRDI QIDQ4523706
No author found.
Publication date: 14 January 2001
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
03B35: Mechanization of proofs and logical operations
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos, Toward unification of exact and heuristic optimization methods, An improved formulation for the multi-depot open vehicle routing problem, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, On the hop-constrained survivable network design problem with reliable edges, A hierarchy of relaxations for linear generalized disjunctive programming, Learning from conflicts in propositional satisfiability, An LPCC approach to nonconvex quadratic programs, The stop-and-drop problem in nonprofit food distribution networks, Reverse propagation of McCormick relaxations, Prominent classes of the most general subsumptive solutions of Boolean equations, An algorithm for approximating the Pareto set of the multiobjective set covering problem, Combined planning and scheduling in a divergent production system with co-production: a case study in the lumber industry, A combined CLP-MILP approach for scheduling commodities in a pipeline, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, On the separability of subproblems in Benders decompositions, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Scheduling and routing of automated guided vehicles: A hybrid approach, A Benders approach for computing lower bounds for the mirrored traveling tournament problem, Logic cuts for multilevel generalized assignment problems., Constraint programming and operations research, A Benders decomposition-based framework for solving quay crane scheduling problems, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, Logic based Benders' decomposition for orthogonal stock cutting problems, A microkernel architecture for constraint programming, Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling, Multi-objective branch and bound, Optimizing the supply chain configuration for make-to-order manufacturing, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, Information-based branching schemes for binary linear mixed integer problems, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, A robust disaster preparedness model for effective and fair disaster response, GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs, Graph coloring inequalities from all-different systems, Petroleum supply planning: reformulations and a novel decomposition algorithm, Submodularity and its application to some global constraints, On convex quadratic programs with linear complementarity constraints, Proving Arrow's theorem by \texttt{PROLOG}, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, A polyhedral approach to the \textit{alldifferent} system, Integrated production and material handling scheduling using mathematical programming and constraint programming, Single-facility scheduling by logic-based Benders decomposition, A decomposition approach for solving a broadcast domination network design problem, Processes and continuous change in a SAT-based planner, On a decision procedure for quantified linear programs, Round robin scheduling -- a survey, Searching for mutually orthogonal Latin squares via integer and constraint programming, A class of stochastic programs with decision dependent uncertainty, What we can learn from conflicts in propositional satisfiability, Semidefinite Programming and Constraint Programming, Mixed Integer Linear Programming Formulation Techniques, Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Combinatorial Benders' Cuts for the Strip Packing Problem, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP, Horn representation of a concept lattice, Challenges in Enterprise Wide Optimization for the Process Industries, Event-Time Models for Supply Chain Scheduling, Logic-based MultiObjective Optimization for Restoration Planning
