scientific article
From MaRDI portal
Publication:3184605
zbMath1175.90011MaRDI QIDQ3184605
No author found.
Publication date: 21 October 2009
Full work available at URL: http://www.sciencedirect.com/science/book/9780444527264
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx) Operations research and management science (90Bxx)
Related Items
The Complexity of General-Valued CSPs, The solution space structure of planted constraint satisfaction problems with growing domains, A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming, A review of literature on parallel constraint solving, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, SYMMETRIES IN MODAL LOGICS, Algebras for Tree Decomposable Graphs, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Super-reparametrizations of weighted CSPs: properties and optimization perspective, Unnamed Item, Machine learning and logic: a new frontier in artificial intelligence, The impact of heterogeneity and geometry on the proof complexity of random satisfiability, Comparing optimization methods for radiation therapy patient scheduling using different objectives, Solution Enumeration by Optimality in Answer Set Programming, Unnamed Item, Monitoring of perception systems: deterministic, probabilistic, and learning-based fault detection and identification, A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles, Adding partial functions to Constraint Logic Programming with sets, Contractibility for open global constraints, Clingcon: The next generation, CASP solutions for planning in hybrid domains, A conflict-directed approach to chance-constrained mixed logical linear programming, Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, Sequential model-based diagnosis by systematic search, Learning reward machines: a study in partially observable reinforcement learning, Constraint propagation on GPU: a case study for the cumulative constraint, Maximum feasibility estimation, Combining optimisation and simulation using logic-based Benders decomposition, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations, Real-time passenger bus routing problems with preferences and tradeoffs, Beyond NP: Quantifying over Answer Sets, Approximate Counting with Deterministic Guarantees for Affinity Computation, Complexity of minimum-size arc-inconsistency explanations, Solving infinite-domain CSPs using the patchwork property, The Synchronized Dynamic Vehicle Dispatching Problem, And Rijndael? Automatic related-key differential analysis of Rijndael, Learning constraints through partial queries, CliSAT: a new exact algorithm for hard maximum clique problems, SUNNY-CP and the MiniZinc challenge, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Optimization in liner shipping, Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic, MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*, A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems, Optimization in liner shipping, Constraint Answer Set Solving, Constraint programming-based column generation, Automatic Proofs of Termination With Elementary Interpretations, Lazy Constraint Imposing for Improving the Path Constraint, A translational approach to constraint answer set solving, Constraint programming-based column generation, Unnamed Item, Robust Solutions in Unstable Optimization Problems, Unnamed Item, An adaptive prefix-assignment technique for symmetry reduction, Parameterized Complexity of the Workflow Satisfiability Problem, Enumeration of AG-Groupoids, A New Necessary Condition for Shortest Path Routing, A bounded space algorithm for online circle packing, The External Interface for Extending WASP, CHR for Imperative Host Languages, On the geometry of symmetry breaking inequalities, Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms, Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited, Constraint Optimization Techniques for Exact Multi-Objective Optimization, A self-adaptive biogeography-based algorithm to solve the set covering problem, Time Complexity of Constraint Satisfaction via Universal Algebra, Dualities for Constraint Satisfaction Problems, The Monoids of Order Eight and Nine, Generic Constraint-based Block Modeling using Constraint Programming, Lifted Reasoning for Combinatorial Counting, Structural decompositions for problems with global constraints, Non-local configuration of component interfaces by constraint satisfaction, Learning optimal decision trees using constraint programming, Power of pre-processing: production scheduling with variable energy pricing and power-saving states, An abstract domain to infer symbolic ranges over nonnegative parameters, Filtering algorithms for the multiset ordering constraint, Computing leximin-optimal solutions in constraint networks, Hard constraint satisfaction problems have hard gaps at location 1, The complexity of weighted Boolean \#CSP with mixed signs, Metaheuristics for solving a multimodal home-healthcare scheduling problem, Binary constraint satisfaction problems defined by excluded topological minors, Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints, Contractor programming, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, Tractability-preserving transformations of global cost functions, Workforce planning incorporating skills: state of the art, Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals, Solving constrained optimization problems by solution-based decomposition search, Performances of pure random walk algorithms on constraint satisfaction problems with growing domains, A hybrid integer and constraint programming approach to solve nurse rostering problems, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, A constraint programming based column generation approach to nurse rostering problems, A bi-objective approach for scheduling ground-handling vehicles in airports, Residuation for bipolar preferences in soft constraints, Representing and solving finite-domain constraint problems using systems of polynomials, Classes of submodular constraints expressible by graph cuts, Towards breaking more composition symmetries in partial symmetry breaking, A novel non-linear approach to minimal area rectangular packing, Automatically improving constraint models in Savile Row, Interval-valued soft constraint problems, Lagrangian bounds from decision diagrams, The fixed vertex property for graphs, A hybrid algorithm for the DNA sequencing problem, Implementing logical connectives in constraint programming, Confidence-based reasoning in stochastic constraint programming, Subexponential concurrent constraint programming, A new achievement scalarizing function based on parameterization in multiobjective optimization, Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers, \textsc{NeVer}: a tool for artificial neural networks verification, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, Dominance rules in combinatorial optimization problems, A hybrid tractable class for non-binary CSPs, On getting rid of the preprocessing minimization step in MUC-finding algorithms, What is answer set programming to propositional satisfiability, The power of propagation: when GAC is enough, Mining time-constrained sequential patterns with constraint programming, A combined CLP-MILP approach for scheduling commodities in a pipeline, A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems, Reliable amplitude and frequency estimation for biased and noisy signals, Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs, Combining restarts, nogoods and bag-connected decompositions for solving csps, Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining, On the modelling and optimization of preferences in constraint-based temporal reasoning, Constraint programming approach to a bilevel scheduling problem, Data transfer planning with tree placement for collaborative environments, A survey of constraint-based programming paradigms, Colouring, constraint satisfaction, and complexity, Itemset mining: a constraint programming perspective, Guarantees and limits of preprocessing in constraint satisfaction and reasoning, A unified theory of structural tractability for constraint satisfaction problems, Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach, Solving the quorumcast routing problem by constraint programming, Interval-based projection method for under-constrained numerical systems, Reformulation based MaxSat robustness, On singleton arc consistency for CSPs defined by monotone patterns, Boosting the feasibility pump, A constraint propagation approach to structural model based image segmentation and recognition, A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem, A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming, Finding a given number of solutions to a system of fuzzy constraints, Introduction to the special issue on combining constraint solving with mining and learning, MiningZinc: a declarative framework for constraint-based mining, Mining top-\(k\) motifs with a SAT-based framework, Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems, Constrained clustering by constraint programming, Semantic-based regularization for learning and inference, Constraint acquisition, Empirical decision model learning, An initial study of time complexity in infinite-domain constraint satisfaction, Exploiting subproblem optimization in SAT-based maxsat algorithms, The expressive power of valued constraints: Hierarchies and collapses, The expressive power of binary submodular functions, Decision-making coordination and efficient reasoning techniques for feature-based configuration, Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques, Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems, An approximation trichotomy for Boolean \#CSP, Engineering constraint solvers for automatic analysis of probabilistic hybrid automata, A constraint-based approach to enigma 1225, A note on some collapse results of valued constraints, Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination, AllDifferent-based filtering for subgraph isomorphism, Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints, Non-binary quantified CSP: Algorithms and modelling, Cutting plane algorithms for solving a stochastic edge-partition problem, Feasibility pump 2.0, From decomposable to residual theories, Reasoning from last conflict(s) in constraint programming, On the complexity of reasoning about opinion diffusion under majority dynamics, Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems, Set constraint model and automated encoding into SAT: application to the social golfer problem, Improving probabilistic inference in graphical models with determinism and cycles, Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form, aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming, PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF, An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations, A logical approach to efficient Max-SAT solving, Domain filtering consistencies for non-binary constraints, On planar valued CSPs, \textsc{Conjure}: automatic generation of constraint models from problem specifications, Fuzzy sets for image processing and understanding, Multi-language evaluation of exact solvers in graphical model discrete optimization, Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint, Three generalizations of the FOCUS constraint, A Proof Theoretic Study of Soft Concurrent Constraint Programming, Measures of balance in combinatorial optimization, Towards Copeland optimization in combinatorial problems, An exemplar-based clustering using efficient variational message passing, Algebraic model counting, Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem, Underground mine scheduling of mobile machines using constraint programming and large neighborhood search, Minimax problems of discrete optimization invariant under majority operators, On the speed of constraint propagation and the time complexity of arc consistency testing, Implementation of a new expression for the search direction in simulations of structures with buckling and post-buckling: ``two-scale impedance, Exact stochastic constraint optimisation with applications in network analysis, A graph-based constraint programming approach for the integrated process planning and scheduling problem, A constraint programming model for fast optimal stowage of container vessel bays, A constraint programming approach for a batch processing problem with non-identical job sizes, Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited, Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section, Semiring-Based Soft Constraints, Computing partial hypergraphs of bounded width, Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, Achieving consistency with cutting planes, Tractable cases of the extended global cardinality constraint, Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite, The Expressive Power of Valued Constraints: Hierarchies and Collapses, Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems, Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$, Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs, Characterizing acyclic graphs by labeling edges, Model-checking precision agriculture logistics: the case of the differential harvest, A Framework for Distributing Real-Time Functions, Generating custom propagators for arbitrary constraints, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem, Solving computational problems in the theory of word-representable graphs, A 44-Element Mesh of Schneiders’ Pyramid, Solving diameter-constrained minimum spanning tree problems by constraint programming, A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization, Computing difference abstractions of linear equation systems, A framework for step-wise explaining how to solve constraint satisfaction problems, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, The packing while traveling problem, Argumentation frameworks as constraint satisfaction problems, Inventory rebalancing and vehicle routing in bike sharing systems, Conflict-driven answer set solving: from theory to practice, Constraint programming for stochastic inventory systems under shortage cost, In search of balance: the challenge of generating balanced Latin rectangles, Parameterized Complexity Results in Symmetry Breaking, Pushing the frontier of minimality, Reachability in parametric interval Markov chains using constraints, Orbital shrinking: theory and applications, A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints, CP methods for scheduling and routing with~time-dependent task costs, Computing AES related-key differential characteristics with constraint programming, Semidefinite Programming and Constraint Programming, Reliable nonlinear state estimation involving time uncertainties, Classifier-based constraint acquisition, Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking, A subdivision algorithm to reason on high-degree polynomial constraints over finite domains, Pruning external minimality checking for answer set programs using semantic dependencies, Disjoint direct product decompositions of permutation groups, A note on computational approaches for the antibandwidth problem, Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time, Epistemic graphs for representing and reasoning with positive and negative influences of arguments, Residuation for soft constraints: lexicographic orders and approximation techniques, Online control of enumeration strategies via bat algorithm and black hole optimization, A constraint programming method for advanced planning and scheduling system with multilevel structured products, Efficient Constraint Propagation for Graph Coloring, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids, MiniBrass: soft constraints for MiniZinc, A logic-based approach to incremental reasoning on multi-agent systems, Actions of the hyperoctahedral group to compute minimal contractors, Lifted structural invariant analysis of Petri net product lines, Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns, Methods for solving reasoning problems in abstract argumentation -- a survey, Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction, The octagon abstract domain for continuous constraints, meSAT: multiple encodings of CSP to SAT, Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction, Self-driven algorithm for solving supermodular \((\max,+)\) labeling problems based on subgradient descent, Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems, Redundant disequalities in the Latin square problem, View-based propagation of decomposable constraints, Mixed-integer linear programming, constraint programming and column generation approaches for operating room planning under block strategy, Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length, An algorithm-independent measure of progress for linear constraint propagation, Variable and value elimination in binary constraint satisfaction via forbidden patterns, A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Uses Software
