몇달 전 hELLO 티스토리 스킨을 우연히 발견한 뒤부터, 비공개로 닫아놨던 블로그를 복구하여 아카이빙 목적으로 사용하고 싶다는 생각이 들었습니다. 따라서 여유가 생기면 틈틈이 5~10년 전 포스팅한 글들을 복구 할 예정이며, github에 기록해놓은 글들도 추후 옮겨서 작성하려고 합니다. hELLO 티스토리 스킨동 스킨은 다크모드, 목차, 코드 하이라이팅 등 사용자 편의성을 고려한 기능들과 심플하면서도 깔끔한 디자인이 특징입니다.🔗hELLO · Designed By 정상우. 다음은 현재까지 복구 완료된 내용과 시점 등을 추후 정보성으로 참고하고자 기록한 것입니다. (2025.11.17.) Algorithms 관련 포스팅 일부 복구 완료(복구완료) Eff, Anal, and Order / Divide..

Basic ConceptsSuppose a salesperson is planning a sales trip that includes 20 cities. Each city is connected to some of the other cities by a road. To minimize travel time, we want to determine a shortest route that starts at the salesperson’s home city, visits each of the cities once, and ends up at the home city. This problem of determining a shortest route is called the Traveling Salesperson ..

Basic ConceptsIn general, the breadth-first search strategy has no advantage over a depth-first search (backtracking).🔗 Backtracking with the 0-1 Knapsack problem (Depth-First Search)🔗 Branch-and-Bound with the 0-1 Knapsack problem (Breadth-First Search)However, we can improve our search by using our bound to do more than just determine whether a node is promising. After visiting all the child..

Basic ConeptWe show how to use the branch-and-bound design strategy by applying it to the 0-1 Knapsack problem. First we discuss a simple version called breadth-first search with branch-and-bound pruning. After that, we show an improvement on the simple version called best-first search with branch-and-bound pruning. 👉 분기 한정 설계 전략을 0-1 배낭 문제에 적용한다. 먼저, 분기 한정 가지치기를 적용한 너비 우선 탐색(Breadth-First Sear..

Basic ConceptThe branch-and-bound design strategy is very similar to backtracking in that a state space tree is used to solve a problem. The differences are that the branch-and-bound method (1) does not limit us to any particular way of traversing the tree and (2) is used only for optimization problems. A branch-and-bound algorithm computes a number (bound) at a node to determine whether the nod..

Basic ConceptRecall that in this problem we have a set of items, each of which has a weight and a profit. The weights and profits are positive integers. A thief plans to carry off stolen items in a knapsack, and the knapsack will break if the total weight of the items placed in it exceeds some positive integer $W$. The thief’s objective is to determine a set of items that maximizes the total pro..