scientific article; zbMATH DE number 1550909
From MaRDI portal
zbMath0974.90001MaRDI QIDQ4523706
No author found.
Publication date: 14 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Petroleum supply planning: reformulations and a novel decomposition algorithm, Constraint programming and operations research, Submodularity and its application to some global constraints, A Benders decomposition-based framework for solving quay crane scheduling problems, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, What we can learn from conflicts in propositional satisfiability, On convex quadratic programs with linear complementarity constraints, On the separability of subproblems in Benders decompositions, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Proving Arrow's theorem by \texttt{PROLOG}, Scheduling and routing of automated guided vehicles: A hybrid approach, Logic based Benders' decomposition for orthogonal stock cutting problems, On the hop-constrained survivable network design problem with reliable edges, Classes of linear programs solvable by coordinate-wise minimization, Combinatorial Benders' Cuts for the Strip Packing Problem, Optimizing the supply chain configuration for make-to-order manufacturing, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, Logic-based Benders decomposition for wildfire suppression, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, The bus sightseeing problem, Combining optimisation and simulation using logic-based Benders decomposition, Efficient MIP techniques for computing the relaxation complexity, Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, Achieving consistency with cutting planes, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, A hierarchy of relaxations for linear generalized disjunctive programming, A polyhedral approach to the \textit{alldifferent} system, Logic cuts for multilevel generalized assignment problems., Learning from conflicts in propositional satisfiability, 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, An LPCC approach to nonconvex quadratic programs, Integrated production and material handling scheduling using mathematical programming and constraint programming, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, A microkernel architecture for constraint programming, Single-facility scheduling by logic-based Benders decomposition, A decomposition approach for solving a broadcast domination network design problem, The stop-and-drop problem in nonprofit food distribution networks, Logic-Based Benders Decomposition for Large-Scale Optimization, Processes and continuous change in a SAT-based planner, On a decision procedure for quantified linear programs, Reverse propagation of McCormick relaxations, Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos, Prominent classes of the most general subsumptive solutions of Boolean equations, An algorithm for approximating the Pareto set of the multiobjective set covering problem, Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling, Multi-objective branch and bound, Round robin scheduling -- a survey, Information-based branching schemes for binary linear mixed integer problems, 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, A robust disaster preparedness model for effective and fair disaster response, A class of stochastic programs with decision dependent uncertainty, A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions, An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability, Transmission network investment using incentive regulation: a disjunctive programming approach, An improved formulation for the multi-depot open vehicle routing problem, 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, A Benders approach for computing lower bounds for the mirrored traveling tournament problem, 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, Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect, GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs, Order assignment and scheduling under processing and distribution time uncertainty, Toward unification of exact and heuristic optimization methods, Graph coloring inequalities from all-different systems, Strengthening of feasibility cuts in logic-based benders decomposition, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
